//reverse a elements of queue by using stack

import java.util.*;

class ReverseQueue

{

public static void main(String args[])

{

Queue<Integer> q=new LinkedList<>();

q.add(1);

q.add(2);

q.add(3);

Stack<Integer> s=new Stack<>();

while(!q.isEmpty())

{

s.push(q.remove());

}

while(!s.isEmpty())

{

q.add(s.pop());

}

System.out.println(“Reverse queue=” +q);

}

}

output:

Reverse queue=[3, 2, 1]