Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.

In this Video, we are going to learn about Linked List and its types.

There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “

Do provide you feedback in the comments, we are going to make it best collectively.

Connect with me here:

Telegram Group Link: Love Babbar CODE HELP

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Introduction
00:31 - why Linked List ?
03:07 - Promotion
04:10 - Linked List vs Dynamic Array or Vector
05:24 - Advantages of Linked List
06:57 - Singly Linked List
12:10 - Implementation/Code
16:23 - InsertAtHead
19:25 - Insertion at Head Code
26:05 - InsertAtTail
27:00 - Insertion at Tail Code
29:56 - InsertInMiddle
31:15 - Insertion in Middle Code
41:08 - Deletion
42:30 - Deletion Code
59:50 - Doubly Linked List
01:05:31 - Insertion At Head Code
01:09:07 - Insertion At Tail Code
01:14:00 - Insertion at any Position
01:20:42 - Correction
01:28:56 - Deletion of Node in DLL Implementation
01:40:00 - Circular Linked List
01:48:00 - Insert Node in CLL
01:55:50 - Insertion Code
01:59:50 - Traversal Code
02:06:20 - Deletion Code
02:20:00 - Homework

#DSABusted #LoveBabbar

[AyushYadav-pkhh]

It took me 10hrs to understand the concept of linkedlist but now I am fully confidence 🥺🥺🥺

[avishkarpatil]

Comment at 1:36:22- Don't forget this crucial edge case!

Hey everyone, just a quick heads-up! In the code provided, there's a crucial edge case that was almost missed. To ensure the correct functioning of this deleteNode function, please remember to include the following line:

if(curr->next != NULL){
curr->next->prev = prev; // This line is essential to maintain the integrity of the linked list.
}

It's a small but important detail that should not be overlooked, especially when deleting a node from a doubly linked list. Happy coding!

[ritikamehta]

The consistency and the content of this course is lit!!🔥🔥🔥

[abhinavtripathi]

"Love babbar" is a Person who can teach anything to anybody in very easy way.

[vinayaksharma-ysip]

Best Series....even better than many of the paid courses!!!

[therealartist]

linked list is a hard topic for beginners and yaha par bhaiya ko thoda dheere dheere aram se dubara cheeze samjhana tha but bhaiya bhot fast chale gaye

[I_Anupam_Pandey]

Lecture 44 Attendance
It is simply amazing you uploading 1 hour + content literally every other day

[shubhampatel_]

1:35:38 here love bhaiya forgot to tell about we have to also change the curr -> next -> prev = prev we have to change this as well if we are deleting any middle node apart from this lecture is super duper Awesome. Love from Bottom Of My Heart.


edit-> spelling correction.

[girish]

The best DSA course ever 🔥🔥 consistent from day one

[shaileshkaiwart]

You are GOD for beginners. 🎅
Even a non-CS branch learner can develop a good understanding of DSA by watching your lectures.

[ayushkushwaha]

Currently on your recursion videos. Will catch up soon! Thanks for your efforts💯🔥

[mdtausifalam]

i just love the way you teach and cleared all the the complex part with an ease. kudos to you

[ntrsdiaries]

finally completed this video....hats off to your hardwork 🙏🙏🙏🙏

[topdog]

Thanks bhaiya I never thought of writing codes of linked list myself.
But now I am confident to do it

[lsuremusic]

LL is good concept and needs time to interpret as a beginner. i request sir to upload 1hr videos for concept related videos so that we get decent time to grasp it.
💓

[rishabhmohan_]

Best DSA course available on YouTube right now 🔥🔥🔥...
Hats off Bhaiya

[tanmayghosh]

58:40 here we pass the tail as ref argument and if prev->next == NULL then tail = prev; delete curr;

....rest of the code
while (count < position)
{
prev = curr;
curr = curr->next;
count++;
}
prev->next = curr->next;
curr->next = NULL;
if (prev->next == NULL) {
tail = prev;
}
delete curr;
}

[coderfek]

Clean lectures. Just wanted to point out one thing. At 55:00 instead of initializing temp->next = NULL or curr->next = NULL, just interchange the two lines in the deconstructor code and put them in order so, this->next is first initialized to NULL and then its deleted. Thank you!

[codetackle]

best video on youtube on linked list i watched u explain a concept easily and clearly keep making such type of video ..

[suvigyabasnotra]

Long videos are unintentionally scary imo. Though, you may upload as per your convenience but sooner if possible! Try to finish this course by March itself with a video per day because Placement season is almost there. I'm on a re-run of your videos with the homework and will catch up again to the current video in a few days! You keep up your consistency and we'll keep ours!