2.11 Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures

******************************************
See Complete Playlists:

***********************************************

Connect & Contact Me:

#insertionindoublylinkedlist, #doublylinkedlist, #jennyslectures, #linkedlist, #datastructures

[shaannky]

This is 2024 and still this series can teach you better DSA than any BIG Universities colleges or professors.

[yashtyagi]

Literally IIT level teaching one of the brilliant teacher I have seen yet thanku so much mam 🤗

[contentcreator]

My friend said to me that in c or c++ programming linked list is very hard than any topics but when i watch your every lecture i feel that linked list is very easy than others topics.

[amangupta]

31:35 Third way
newnode->prev = temp;
temp->next->prev = newnode;
newnode->next = temp->next;
temp->next = newnode;

[SpharSarmiento]

currently studying data structures in my summer vacation and so far im doing great understanding all the concepts of singly and insertion of doubly linked lists!

Learning from a great teacher feels like we are learning magic!

[-.-_._--]

0:10 create
13:55 insert at beg
17:17 insert at end
20:45 at pos

[VishnuvardhanKolasani]

3rd way of inserting
newnode->next=temp->next;
temp->next->prev=newnode;
newnode->prev=temp->next;
temp->next=newnode;
thank you mam, because of you i'm able to understand each and every concept clearly.👨‍🎓

[aasthamurdia]

I wonder how could anyone dislike your videos.Your video is just amazing ma'am.

[saritakumari-ohfs]

Because of you I become developer from QA. Thanks... Best lecture of DSA

[Mysteryp]

*temp logic in create node and *tail logic sounds very similar....

but best clear and explanation compare to my other youtube videos.
I think I found my youtube professor. thank you~!

[aryan]

Maam as you explained in one video where we used prev pointer and temp pointer to insert at a given pos in singly linked list, so i have tried to apply it in doubly linked list using a pointer name save and applied following operation:
while(i<Pos) // Initially i=1
{
save=temp;
temp=temp->next;
i++;
}
nn->next=save->next; //nn is newnode
temp->prev=nn;
save->next=nn;
nn->prev=save;

Thank you for explaining everything at such a precise lvl.

[jeebasharin]

After your teaching I feel coding is easy in linked list . Thanks mam👍👍👌👌

[usmansadiq]

Pretty Good and Straight Explanation with out confusing students. Thanks.

[kavyag]

You are the "Best" Lecture ever. I had zero knowledge of DSA, but now I am learning a lot from you. Million thanks ma'am😍🤩🥰 Love from Karnataka!!

[SharathR-mwyo]

literally the best teacher that i ever seen... sometimes i thought of sharing this to my lecturers, so that they can learn and will teach to us😂

[mbemmerganganal]

That smile 😄 at the end of the lecture gives a energy to continue learning

[LoveIsLifeTurkishIndia]

So, conclusion is, we were declaring temp locally in all function.

Tail is doing the work of temp, but tail is declared globally .

[bhargavsai]

She made dsa easier for every student. Thank you madam

[aishwaryaghosh]

I have ds in 3rd sem u have helped me a lot💖

[ramimhasan]

her way of teaching is really good. Thank you mam for providing these lecture.