Chapter 5, Problem 1C

Explanation of Solution

A queue can be implemented using two stacks. Let queue to be implemented be “q” and stacks used to implement “q” be “stack1” and “stack2”. The “q” can be implemented in two ways:

Method 1 (By making enQueue operation costly):

enQueue(q, x)

• While “stack1” is not empty, push everything from “stack1” to “stack2”.
• Push “x” to “stack1” (assuming size of stacks is unlimited).
• Push everything back to “stack1”.

dnQueue(q)

• 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”...