[FEATURE REQUEST] <Implementation of Stack using Queues> #4789
Description
What would you like to Propose?
Hello,
I would like to add the algorithm of implementation of Stack using Queues in java.
Issue details
Stack using Queues Algorithm
-
Initialization:
- Create two empty queues, let's call them
queue1andqueue2.
- Create two empty queues, let's call them
-
Push Operation:
- To push an element into the stack, enqueue the element to
queue1. - Now pop all the elements from
queue2until it becomes empty. - Swap the two queues.
- For the next push operation
queue1becomesqueue2and vice versa.
- To push an element into the stack, enqueue the element to
-
Pop Operation:
- pop the topmost element from
queue2.
- pop the topmost element from
-
Top Operation:
- Peek and return the last element from
queue2.
- Peek and return the last element from
Additional Information
I would like to add this Algorithm