Double Ended Queue - Additions

Video 9 of a series explaining the basic concepts of Data Structures and Algorithms.
This video explains the basic concepts behind additions into a double ended queue.
This video is meant for educational purposes only.

[@lokeshjain4750]

superb job..good explanation and special thanks..

[@humanology3254]

Thanku mam for your great work towards us

[@ronakverma7070]

Very nicely explained dear.. great work keep it up.👍💯❤️✨

[@sandy6162]

Clear explanation thanks you for this video . please make video on implementation of circular array

[@AdeshPaul]

Very well explained.

[@basicsofdatastructuresanda3793]

@4:17 for the first insertion from the rear, the rear will get incremented two times, inside if where r changes from-1 to 0 and also when we come out of if where rear++

[@mudassirshoukat3395]

your this video and previous video helps me alot

[@Steve-ft8ux]

Hi, Lalitha: Thank you for the great explanation. What if there is an empty queue, and I call addrear, then I call addfront? After, I call addrear, the index of f=0, r=0. then, I try to call addfront, because of the index of f=0, I think the program will tell me full can't be add. but in fact. the queue is only been used 1 space in the entire queue. In this case, how do I fix it? remove the queue[0] to queue[1] ?

[@prabhuprabhat_bhatia4506]

If you got the answer of your question,please tell me.

[@yona5861]

Then add to it &&rear== size-1

[@7hitter777]

Mam face reveal plsssss.Your explaination is awesome even my teacher could not match u

[@meetpatel1011]

Thank you so much ma'am

[@Tijolo]

Hey Lalitha, me and my friend are having a problem because we can´t use "int", we have to use an "Item" that i supose we have to create, just asking if it can be done, and if so how? Thanks a lot for this video, it helped big time !!

[@daksh1950]

Excuse me ma'am, I have a couple of doubts as to what the initial values of the rear and front should be; in addfront when you find out that front = -1 then you initialize front and rear with 0 and then you proceed to put the value in arr[0] in it but the next time you call the function value of front would still be 0 and the function will end. thoughts?

[@rupeshraut994]

Initialize front = rear = -1 at beginning.

[@mudassirshoukat3395]

ma'am great explanation. Thank you. and greetings from Pakistan. hitted subscribe

[@puskarbanerjee4903]

Your code won't work if we add 2 elements from front, then 3 from rear...for resolving this issue, we have to check if front is equal to rear or not, in both functions...if yes, we will flash "queue is full"...and according to this program, we have to declare front as size-1, not -1, otherwise f-- won't give a valid index

[@mounikavarshini8045]

can u please upload display function for dequeue

[@techintelugu1197]

I want ur lecture s now on java programming plzz come back❤️

[@drjanhavivcse2614]

Priority queue program plz ma’am