-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue.java
60 lines (47 loc) · 1.18 KB
/
Queue.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// This class implements the Queue
public class Queue<V> implements QueueInterface<V>{
private NodeBase<V>[] queue;
private int capacity, currentSize, front, rear;
public Queue(int capacity) {
queue = new NodeBase[capacity];
this.capacity = capacity;
this.front = 0;
this.rear = -1;
this.currentSize = 0;
}
public int size() {
return currentSize;
}
public boolean isEmpty() {
return (size() == 0 );
}
public boolean isFull() {
return (size() == capacity);
}
public void enqueue(Node<V> node) {
if(!isFull())
{
rear = (rear+1)% capacity;
queue[rear] = (NodeBase<V>)node;
currentSize++;
}
}
public NodeBase<V> dequeue() {
if(isEmpty())
{
return null;
}
NodeBase node = queue[front];
front = (front+1)% capacity;
currentSize--;
return node;
}
public void display(){
if (!this.isEmpty()) {
int b = this.currentSize;
for(int i = 0;i<b;i++){
this.dequeue().show();
}
}
}
}