This is one of the interview questions asked in technical or data structure round.
As we know stack is first in last out and queue is first in first out.
Here we have to implement the behaviour of queue using 2 stacks.
So let's begin with one of the approaches,
For 2 stacks we have define 2 arrays;
For insertion or push, we will use stack1.
For any insertion, we can push it in stack1 array.
Now when we remove or pop, the first pushed element should be removed first i.e behaviour of a queue.
So if we poped from stack1 we will get the behaviour of stack here.
stack1.pop()//"C" will be removed i.e behaviour of stack last in first out.
We can't use this, so we will need stack2 for this purpose to implement the behaviour of the queue.
d)Remove or pop:
For first remove or pop, we will need to pop every element in stack1 and push it to stack2.
So here are the values of stack2 and stack1,
And then pop from stack2.
i.e stack2.pop()//"A" will be poped which is inserted first.
So here we have implemented behaviour of queue.
For another insertion or push,
Now for 2nd remove operation first we need to check if stack2 is empty.
If not empty then just pop element from stack2 for every remove
operation till stack2 becomes empty.
Now stack 2 is empty, So we can't pop .
So if stack2 is empty then pushed all elements from stack1 to stack2 and pop stack2.
i.e one that we had done for first remove or pop operation.
By this approach, we can implement a queue using two stacks.
I hope you like this article. Please stay connected for more such articles.
If any doubts please let me know in the comment section.