• View
• Edit
• History
• Print

20130325a

Queue with two stacks

Write a MyQueue class, which implements a queue data structure using two stacks internally!

The class should implement the following operations:

• pushright: append to the end of the queue
• popleft: return the first element of the queue (and remove it from the queue)
• empty: Is the queue empty?
• size: number of elements in the queue

Bonus point

The number of data moves between the stacks can be reduced. If you figure out how and implement it, then you get +1 extra point. A little help: when are there unnecessary data moves?