Que18.java

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

public class Que18 {
    static Queue<Integer> queue;
    static void Print()
    {
        while (!queue.isEmpty()) {
            System.out.print( queue.peek() + " ");
            queue.remove();
        }
    }
    static void revqueue()
    {
        Stack<Integer> stack = new Stack<>();
        while (!queue.isEmpty())
        {
            stack.add(queue.peek());
            queue.remove();
        }
        while (!stack.isEmpty())
        {
            queue.add(stack.peek());
            stack.pop();
        }
    }
    public static void main(String args[])
    {
        queue = new LinkedList<Integer>();
        queue.add(10);
        queue.add(20);
        queue.add(30);
        queue.add(40);
        queue.add(50);
        queue.add(60);
        queue.add(70);
        queue.add(80);
        queue.add(90);
        queue.add(100);
        System.out.println("Queue: \n"+queue);
        System.out.println("\nReversed Queue: ");
        revqueue();
        Print();
    }
}