import java.util.*; class CircularQueueImplement { int size,front=0,rear=0; int index=-1; int queue[]; CircularQueueImplement(int m) { size = m; queue = new int[size]; } void enqueue(int element) { if(rearsize-1) { if(front>0){ rear =0; queue[rear++] = element; } } } void dequeue() { front++; } void display() { if(rear>front) { for(int i=front;i<=rear-1;i++) System.out.print(queue[i]+"\t"); } else { for(int i=front;i