A queue can be implemented using two stacks.
Let queue be represented as " $q$ "
and stacks used to implement $q$ be "stack1" and "stack2".
$q$ can be implemented in two ways:
Method 1 (By making EnQueue operation costly)
This method makes sure that newly entered element is always at the bottom of stack 1, so that deQueue operation just pops from stack1. To put the element at top of stack1, stack2 is used.
- While stack1 is not empty, push everything from satck1 to stack2.
- Push $x$ to stack1 (assuming size of stacks is unlimited).
- Push everything back to stack1.
- If stack1 is empty then error
- Pop an item from stack1 and return it
Method 2 (By making deQueue operation costly)
In this method, in en-queue operation, the new element is entered at the top of stack1. In de-queue operation, if stack2 is empty then all the elements are moved to stack2 and finally top of stack2 is returned.
- Push x to stack1 (assuming size of stacks is unlimited).
- If both stacks are empty then error.
- If stack2 is empty
While stack1 is not empty, push everything from satck1 to stack2.
- Pop the element from stack2 and return it.