Implement Queue using Stack (with Example)

Показать описание

This lecture explains two methods to implement queue using stacks only. The first method assumes Enqueue operation to be costly and second method assumes dequeue operation to be costly. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

Algo: EnQueue Costly

enQueue(q, x)
1) While stack1 is not empty, push everything from stack1 to stack2.
2) Push x to stack1 (assuming size of stacks is unlimited).
3) Push everything back to stack1.
Here time complexity will be O(n)

deQueue(q)
1) If stack1 is empty then error
2) Pop an item from stack1 and return it
Here time complexity will be O(1)

Algo: DeQueue Costly

enQueue(q, x)
1) Push x to stack1 (assuming size of stacks is unlimited).
Here time complexity will be O(1)

deQueue(q)
1) If both stacks are empty then error.
2) If stack2 is empty
While stack1 is not empty, push everything from stack1 to stack2.
3) Pop the element from stack2 and return it.
Here time complexity will be O(n)

Рекомендации по теме

Комментарии

Great video sir. Hope your channel gets the success it deserves.

Dankman

one more method .
Push all the elements in one stack
When to pop:
1. check if stack2 is empty
transfer from stack one to stack 2 then pop
2. check after check 1 stack 2 is empty then empty queue
3. finally pop from stack 2
Why again and again push, pop . Do it only one time.

vinoddiwan

so smooth explanation and audio quality is superb... can you please how did you get such audio quality

aniruddhachunne

thank you teacher, this is very clear explanation, thank you.

linlinli

Excellent explanation Sir.
Thanks 😊👍

SaumyaSharma

sir superb content sir pls keep the code in cpp it makes things much better

mahadevsai

Why we are using stack to implement a queue ? Using array the both enqueue and dequeue operation takes O(1), Is there any special application ... little confused, could you please help me to understand ?

duraivelperumal

Bro can you explain the recursive call stack method to solve this problem?

bikramjitdas

Its wrong you are not following the stack operation rule properly. Kindly do that.

shrutisaxena

Implement Queue using Stack (with Example)

Implement Queue using Stacks - Leetcode 232 - Python

4.6 Implement Queue using Stack in C| Data Structures Tutorials

Implement queue using stack | GeeksforGeeks

Queue Implementation using Stack | O(1) Push and Pop Operations

Implement Stack using Queues - Leetcode 225 - Python

Implement Queue using Stacks (LeetCode 232) | Side by side demo and diagrams

Queue using Stack | C++ Placement Course | Lecture 24.3

Leetcode 232. Implement Queue using Stacks - Python

Program to Implement Double Ended Queue (Deque) Episode: 41 #datastructures #algorithms #queue

Implement Queue using Stacks | Amortised O(1) | Leetcode 232 | Google

Implement Queue using Stacks | Leetcode 232 | Queues & Stack

Implement A Queue Using Stacks - The Queue ADT ('Implement Queue Using Stacks' on LeetCode...

Implement Queue using Stack (Explanation) Part 1

LEETCODE 232 (JAVASCRIPT) | IMPLEMENT QUEUE USING STACKS

Stack Implementation using a Single Queue

Queue - Implement Queue using Stack | Code in Java

Implement Queue using Stacks | Queue in Data Structure & Algorithms | Interview Question Hello W...

Implement Queue using Stack (with Example)

How to Implement a Queue using Stacks in C#

232. Implement Queue using Stacks - LeetCode Blind 75 - JavaScript

232. Implement Queue using Stacks | Stack & Queue

LeetCode 232 | Implement Queue Using Stacks | Solution Explained (Java + Whiteboard)

Implement Stack using Queues (LeetCode 225) | Using single and 2 queues | Visuals and animations

Implement Queue using two Stack & Implement Stack using two Queue | DSA-One Course #51