File size: 1,132 Bytes
c574d3a |
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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 |
// Implementation of the queue data structure
public class Queue{
static int Max = 100;
int a[] = new int[Max];
static int front = -1;// for deletion
static int rear = -1; // for insertion
boolean isEmpty(){
if(front==rear){
return true;
}
return false;
}
boolean isFull(){
if(rear==Max-1){
return true;
}
return false;
}
void enqueue(int x){
if(isFull()){
System.out.println("Queue overflow !!");
}
else{
rear++;
a[rear] = x;
System.out.println(a[rear]+" Enqueued");
}
}
void dequeue(){
if(isEmpty()){
System.out.println("Queue underflow !!");
}
else{
front++;
int x = a[front];
System.out.println(x+" Dequeued");
}
}
void print(){
if(isEmpty()){
return;
}
for(int i=front+1;i<=rear;i++){
System.out.print(a[i]+" ");
}
}
public static void main(String[] args){
Queue q = new Queue();
q.enqueue(3);
q.enqueue(4);
q.enqueue(5);
q.enqueue(6);
q.enqueue(7);
q.dequeue();
q.dequeue();
q.print();
}
}
|