public class Queue { private int[] data; private final int MAXSIZE=20; private int front,rear; public void InitQueue(){ data=new int[MAXSIZE]; front=rear=0; } public void push(int i){ if((rear+1)%MAXSIZE==front){ System.out.println("Queue is full!"); return ; } data[rear]=i; rear=(rear+1)%MAXSIZE; } public Object pop(){ if(rear==front){ System.out.println("Queue is empty!"); return null; } int temp=data[front]; front=(front+1)%MAXSIZE; return temp; } }