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.
Пікірлер: 26
@yvmoksha Жыл бұрын
Clear explanation. Good job!!!
@AdeshPaul5 жыл бұрын
Thanks for teaching.
@sujan_kumar_mitra4 жыл бұрын
explained nicely.thanks
@sangarshlakshya5 ай бұрын
Thankyou for explaination ma'am 🙏🏽
@ShivamYadav-in2jg Жыл бұрын
good explanation of deque Thanks !!!!
@sayanbanerjee22292 жыл бұрын
Such a soothing voice, I really understood it better! Thanks!
@deepanshuchauhan45325 жыл бұрын
Can you tell me the condition in input restricted dequeue and output restricted dequeue of overflow and underflow
@AjaySharma-zs8ex3 жыл бұрын
Thank you.
@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.
@vivekvijay87639 ай бұрын
your videos are very good and able to understand very much. why did you stop posting videos
@Akash-dd6ev Жыл бұрын
Thank u
@madhanmanohar84903 жыл бұрын
Every thing is fine, could you please make video on #Hashing.
@netizenbudiman6768 Жыл бұрын
what if they have 5 index?
@wonderfulvamsi3 жыл бұрын
It's good........I wonder how u managed to not get any shadows of ur hands on the paper
@r.kapilkumar15843 жыл бұрын
I think she turned off shadow in settings, just like PUBG 🙄
@rupeshpatil51474 жыл бұрын
it will be better if you start with empty queue
@amitbudhiraja41353 жыл бұрын
in the last case why we setted the value of r and f to -1--------------we can set it to 0
@sayanbanerjee22292 жыл бұрын
No cause 0 will mean that the 0th index has a value, which is wrong, so we set it to something not in the array index.
@sanjayroy21911 ай бұрын
Madam please provide complete Java program
@MO-fg2cm2 жыл бұрын
ISE people !!
@BSEss5 ай бұрын
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. 🙂
@hiepxuan20083 жыл бұрын
Beautiful hand writing 🥳
@abhishekpawar58042 жыл бұрын
Your voice is too cute😍
@Rahul-nk4vf Жыл бұрын
legends look at left hand ring finger....😜😜
@surajtopal4554 жыл бұрын
😔😔not useful , because there are more condition to implement the dequeue .
@atharvasalpekar2043 жыл бұрын
If you already know all the things. Then why the fuck you are even watching this video at first place. Oversmart 🙄