Question

Explain with example how will you implement Queue using stack data structures.And give the minimum number of stacks required to do the same.
​

Answer 1

Explanation:

Implement Stack using Queues

The problem is opposite of this post. We are given a Queue data structure that supports standard operations like enqueue() and dequeue(). We need to implement a Stack data structure using only instances of Queue and queue operations allowed on the instances.

Stack and Queue with insert and delete operations

Recommended: Please solve it on “PRACTICE” first, before moving on to the solution.