1. Engineering
  2. Computer Science
  3. 3 we can implement a queue using two stacks algorithm...

Question: 3 we can implement a queue using two stacks algorithm...

Question details

3. We can implement a queue using two stacks: Algorithm 1 Enqueue(x) push(stackB,r) Algorithm 2 Enqueue(x) if stackA is empty then while stack B is not empty do pop(stackB) push (stackA, x) if stack A is not empty then return pop(stackA) You can assume that stack operations push0 and poptake O(1) Analyze the amortized runtime for Enqueue) and Dequeue)

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution