Introduction to Algorithms 10.1-7

Title: Implement a stack with two queues and analyze the stack operation run time

Analysis:

The operation of the stack can only be done at the table header, while the queue is queued at the table head, the team can only be carried out at the end of the stack;

Consider changing the bottom element of the stack to the top of the stack, that is, you can perform a pop operation on the table header;

Solution: (without considering overflow)

1. Use two queue A with tmp,tmp queue as relay;

2, when the push operation, in queue A in the queued operation;

3, when the pop operation, so that the elements in queue a team in the queue tmp, until queue A is empty, the queue is inverted, the team head element becomes the tail element, TMP performs the team operation, the same steps in the TMP, the element is inverted into queue a

Operation Run Time Analysis:

Push:o (1)

Pop:o (N)

Introduction to Algorithms 10.1-7