Introduction to Double Ended Queues

Video 8 of a series explaining the basic concepts of Data Structures and Algorithms.

This video introduces a variation of the queue data structure, the double ended queue.

This video is meant for educational purposes only.

[sangarshlakshya]

Thankyou for explaination ma'am 🙏🏽

[sayanbanerjee]

Such a soothing voice, I really understood it better! Thanks!

[deepanshuchauhan]

Can you tell me the condition in input restricted dequeue and output restricted dequeue of overflow and underflow

[yvmoksha]

For 1 one element delete operation by any way front or rear, in any index position values when front==rear, resetting both to -1, which implies empty queue.

[vivekvijay]

your videos are very good and able to understand very much. why did you stop posting videos

[BSEss]

Hello ma'am, in the last case where f > r, i think we can keep on using the queue, because as per your explanation, if f = 2, adding from front will add an element at index:1 and adding an element from rear will add an element at index: 2. Making f again < r. 🙂

[wonderfulvamsi]

It's wonder how u managed to not get any shadows of ur hands on the paper

[madhanmanohar]

Every thing is fine, could you please make video on #Hashing.

[amitbudhiraja]

in the last case why we setted the value of r and f to can set it to 0

[rupeshpatil]

it will be better if you start with empty queue

[sanjayroy]

Madam please provide complete Java program

[Rahul-nkvf]

legends look at left hand ring finger....😜😜

[surajtopal]

😔😔not useful, because there are more condition to implement the dequeue .