// printQueue method for QueueA
    public void printQueue() {
        int tail = (front + n) % 100;
        System.out.println(front);
        System.out.println(tail);
        if (front <= tail)
           for(int i = front; i < tail; i++) 
               System.out.println(q[i].getKey());
        else {
           for(int i = front; i < 100; i++) 
               System.out.println(q[i].getKey());          
           for(int i = 0; i < tail; i++) 
               System.out.println(q[i].getKey());
        }          
    }


// printQueue method for QueueLL
    public void printQueue() {
        Node temp = head;
        while (temp != null) {
            System.out.println(temp.getKey());
            temp = temp.getNext();
        }
    }