Question: How to use two stacks in java to implement a queue so that enQueue runs in O(n) and deQueue runs in O(1)? Suppose the stacks
How to use two stacks in java to implement a queue so that enQueue runs in O(n) and deQueue runs in O(1)? Suppose the stacks have no size limit. Please describe your algorithm without pseudocode.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
