Data Structures in Python: Singly Linked Lists -- Insertion

[@kamaboko1]

You absolutely crush my CS profs. They can't teach their way out of a wet paper bag. Your walkthrough and code examples are great.

[@LucidProgramming]

Wow, thank you so much! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@Foxdon]

Thank you so much for the video: For those who would like to send a string as a node in the insert_after_node function : def insert_after_node(self,prev_node,data): new_node = Node(data) cur_node = self.head while(cur_node.data != prev_node): cur_node = cur_node.next if(cur_node is None): print("previous node is not present in the list") return new_node.next = cur_node.next cur_node.next = new_node

[@LucidProgramming]

Cool, thanks for the contribution!

[@destinationDiscoveries16]

But for this to work, all the nodes should have different data, right?

[@amanjain256]

@@destinationDiscoveries16 not necessary, if there are duplicates, the new node will be inserted after the first occurrence of the given data.

[@Magmatic91]

This is the best tutorial about linkedlists I've come across so far. Really well explained, thank you for your great work.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@sakshamdogra]

by far the best video and trust me, I TRIED WATCHING 20 DIFFERENT VIDS

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@shreya_sinha.]

This playlist is GOLD !! Thanks a lot Lucid Programming

[@LucidProgramming]

No problem at all, I'm very happy to hear you're enjoying it!

[@bommes9802]

Finally found a tutorial for my specific use case. A lot of other tutorials used indexes/predefined stuff, I only had the list items to go on. This worked like a charm. You saved me!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@ghcrocket]

Best DSA Cours on KZbin RN ! Thank you so much !

[@LucidProgramming]

Cheers, and thanks for watching! :)

[@jiajingxie7660]

Thank you very much for the video explanation, you don't just show the code like other bloggers, you will explain with pictures, and! You will often return to the image to parse the code, as a newbie, I love you

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@xaralabosful]

So well explained it's unreal. Cheers man thank you for giving us self taught programmers quiality resources for no cost at all!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@mulhamjarjanazi1707]

the best programming channel on KZbin hands down. clear, thorough, no rush. best wishes

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@nikhilb3880]

THIS. IS. AMAZING. I'm a freshman and my college is explaining DS on C programming for my 1st semester with exact terminologies like head and last_node. You made the exact same with python syntax and way easier explanation than my professor. Thank you

[@LucidProgramming]

Great to hear, thanks for the kind words!

[@arjunreddy3615]

Coding this alongside with you was very much fun. And moreover, code along with linked list explanation is what I have not found elsewhere..Thank you for your time

[@LucidProgramming]

Thanks for taking the ride with me! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@arjunreddy3615]

@@LucidProgramming sure thing!!!

[@roshanmadipalli7290]

Thanks for the video.The explanation is clear For those who like to insert a node at a particular position: def insert_at_position(self, pos, data): current_node = self.head for i in range(pos-1): if(current_node.next): current_node = current_node.next i = i+1 if i != pos-1: print('unable to insert') else: new_node = Node(value) new_node.next = current_node.next current_node.next = new_node

[@roshanmadipalli7290]

sorry for the mistake it is Node(data) instead of Node(value) in the else condition

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. I hope to be putting out more similar videos soon!

[@roshanmadipalli7290]

@@LucidProgramming Definitely sir

[@gauravpatil7977]

i am actually attending bootcamp but did not understand this concept and now got it cleared after watching ur video, thanks a lot!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@hendrag593]

After watching several videos about Linked List, it seems that this is the best video. One may say that this is not apple to apple as I watched this video after learning it from the others first but it is not actually as this video is indeed the best for understanding the Linked List. Thanks Lucid Prog. really appreciate it. God bless.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@sahilbisht3661]

sir how can i say thanks to you i have no words to express my feelings how happy i am now..... i tried udemy and many other paid courses but they make things complex but your tutorial helps me a lot after watching your video on link list it's look more easier then to learn printing hello world from any other youtube tutorial !! thanks to a legend :-)

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@davidtorres7094]

This is definitely the best video I've seen on Linked Lists, keep up the amazing work and thanks a lot!

[@LucidProgramming]

Very flattering. Thank you for the kind words!

[@surathjhakal9386]

thank you so much dude ,literally from 3 days i was scratching my head that how does linked list work

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@hobbyhubbie]

Tackling LL insertion/removal was an absolute nightmare, but your tutorials make a lot of sense! Thanks for these vids -- they're well paced, clear, and extremely useful!

[@LucidProgramming]

Hey Kyle. I'm really happy to hear that my videos help you take an abstract subject like this and break it down in a way that's helpful. Indeed, the first time you see any of this stuff, at least for me, it's going to be awkward. The more time you spend with it and work with it though, it becomes more natural and intuitive. Cheers for working through the difficulty, and keep doing so. Thanks again for your comment, it's always nice to hear that these videos have served utility. Happy coding! :)

[@mgcreativecontents]

you are the best man! you just made it possible to code linkedlist from scratch.

[@LucidProgramming]

Very much appreciate the kind words! Thank you for watching, and thrilled to hear about your progress!

[@qc4257]

who needs a CS degree when you have Vincent! Thanks LucidProgramming :) just subbed

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@vincentkizza3751]

Thank you very much for these videos. They are just a class apart,I dont seem to get enough of them! Thanks again.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@brightonmwamphachi1912]

this tutorial is brief and clear to the point. the best i have seen so far

[@LucidProgramming]

Thank you Brighton! I really appreciate your feedback, and I'm happy to hear that this tutorial has served you well. Cheers, and thanks again for watching! :)

[@vijayanandv1116]

Actually this makes me clear about the topic its simply Great !!! with easier Explanation Especially with the figures drawn.. Well Done :) I like this......................................................

[@LucidProgramming]

Thank you Vijay, I'm very happy to hear that! Sometimes a visualization can just make all the difference :). Cheers for watching, and have a nice day!

[@minhazchowdhury834]

This is the best explanation I came across so far. Thank you sir.

[@LucidProgramming]

Glad to hear it was helpful!

[@semlimi200]

Wow your figures finally helped me understand the function syntax!! Thanks for the awesome tutorial!

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@Neuroprophet]

My linked list finally works after your video. Thank you so much!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@theifedayo]

This is just awesome, the way you simplified it.Thank you so much

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@subramanianchenniappan4059]

GREAT. your explanation and code are very simple to understand . I am a java developer. datastructure code explanation from other channels on youtube are not as clear as yours!. thanks a lot. I am now seeing your other videos

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@bhargavreddy9952]

dude i fu*kin love you , amazing ,i clearly understood everything .Thank u so much

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@designordu159]

thanks so much mate, been tryna wrap my head around this all day.. glad i got to watch your video

[@ashishchaudhari6835]

Thanks for the video I have never seen this type of video, in which such a complex terms are explained clearly and in elaborative manner

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@hosseinshahini4709]

The details you mention in this video are amazing. This helped me a lot. Thank you for that

[@mightyprogrammer2899]

I think Everyone is little confused in the method named insert_after node And i know that this might help you for understanding the simple concept of adding the node after Node def insert_after(self, key, data): cur = self.head while cur: if cur.next is None and cur.data == key: self.append(data) return elif cur.data == key: new_node = Node(data) nxt = cur.next new_node.next = nxt cur.next = new_node cur = cur.next if cur is None: print("previous node is not present in the list") return Here, I used while loop to traverse the linked list and if the data found simply add the node after it and if it not found then simply print the message that ("previous node is not present in the list") Thank you so much Lucid it means alot.

[@LucidProgramming]

Appreciate the clarification you've provided here, @Mighty Programmer, thank you for that!

[@ronaksingh1002]

Thanks a lot man you are literally an amazing teacher Hatts off to you

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@suthirakprom]

You are a beautiful human being. Love you, man.

[@LucidProgramming]

Thanks for the kind words, and thanks for watching!

[@sumitrana8114]

best linked list tutorial for python . Nice work

[@LucidProgramming]

Thank you, I'm very happy to hear that!

[@nadelinnop3095]

thank u so much after countless videos i can finally understand linked list

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@namefunction]

Very helpful. Was finding it so hard to understand this topic a moment ago. Keep it up!

[@LucidProgramming]

Thanks, Cytia. I'm glad that these videos made a tough concept more streamlined for you to understand. Always great to hear that. Cheers, and thanks for watching!

[@shubhamjaiswal2322]

You are such a great tutor i have ever seen for data structure. Your explanations are so good and very clear. Thanks a lot for such wonderful explanation.

[@LucidProgramming]

Thank you, Shubham, that really means a lot to me! Glad to hear that these videos have been serving you well, and thanks again for your kind comment! Cheers!

[@shubhamjaiswal2322]

​@@LucidProgramming Someone please give this tutor the best teaching award or something equal to that (Y)

[@LucidProgramming]

@@shubhamjaiswal2322 Haha, thanks! I greatly appreciate your very nice words! I hope to continue to teach others with more videos in the future. Cheers, and thanks again for watching!

[@shubhamjaiswal2322]

@@LucidProgramming def add_between(self,previous_node,data): new_node = Node(data) current = self.head counter = 0 while current: next_node = current.next if current.data == previous_node: current.next = new_node new_node.next = next_node counter = counter + 1 current = current.next if counter == 0: print("Sorry the entered number", previous_node, "is not in the linked list") return this worked great for me

[@LucidProgramming]

@@shubhamjaiswal2322 Excellent, thank you for sharing! Always good to see a different way of solving the problem. Cheers!

[@SG-kn2jl]

Ahh thanks the base concept was already cleared as I did data structures in C but I wanted to move to python as like implementing graphs and the AVL tree made it around 300 lines, so I just wanted to code less bulky and I'm fairly new to python unlike C...... I must say Ur teaching is exceptionally good, writing one line and explaining it, hats off to u respected sir

[@LucidProgramming]

Thanks, I really appreciate your kind words! Glad to hear you found the videos useful. Cheers, and happy coding!

[@M15t4r1pP4]

I understand doing this in an academic context, but for those who just need to make functional code with linked lists in python, you can simply make on with list() (or [x, y, z, ...]). This will provide functions like append, pop, index (find index of element), insert, and a lot more. Besides this, if you are looking for efficiency, the deque module in collections functions as a list/stack/queue and uses the most efficient algorithms available for these data types in python (I believe). Great video, just thought I’d give my input for those who’d find it useful

[@M15t4r1pP4]

Also, there is pretty good documentation for both the list and deque data struct, so if you’re confused about them, there will be a source that can explain them and their functions to you.

[@LucidProgramming]

Thanks Jack. Yeah, the intent of these videos are more for preparing for a technical interview, and understanding the concepts of the data structure. Also, just to be clear, list() in Python is not a linked list. This is a fundamentally different data structure.

[@devanshsolani2593]

There are less DSA playlists on youtube because they know that they cant be better than this one❤

[@LucidProgramming]

Very kind of you to say, Devansh. Cheers, and thank you for watching!

[@aznthanh23]

Very helpful both theoretically and the implementation singly linked lists in python. Thank you for an awesome explanation.

[@LucidProgramming]

Hi Thanh. Thank you for an awesome comment :). I'm very happy to hear that the video was useful to you, and I sincerely appreciate your comment. Thanks again for watching!

[@ashishmishra7214]

concise, superbly explained found best data structure coverage on python✌🏽

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@yllsulejmani4786]

Thank you so much for this free content, God bless you.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@ehsansaidi2619]

The explanation was very complete and comprehensive. thanks a galaxy

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@rajkumar-vz7vv]

ur videos are really great, clear explanation,understandable . Loved it. I wish i would have found out ur DS playlist ,long back.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@KrazeeKrab]

Insanely helpful and comprehensive video. If you're not in teaching in some way or another, you should consider doing so xD

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@jewelchowdhury9752]

at first time i understand the core things of liked list....thank u so much sir .

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@jewelchowdhury9752]

@@LucidProgramming please sir continue it..best of luck

[@LucidProgramming]

@@jewelchowdhury9752 Thanks! I hope to!

[@kentsang9376]

I am very lucid about linked lists right now!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@beninho]

Peerlessly clear! Thank you!

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@subhamdixit4576]

I have check out many tutorial and pdf but you cleared my doubt thank you

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. I hope to be putting out more similar videos soon!

[@VentusInfinity]

The great explanation it helped me a lot to understand the linked list!

[@LucidProgramming]

Glad to hear it! Thanks for watching and for the kind words!

[@timewrath7723]

Thank you for clearly clarifying SLL's!

[@LucidProgramming]

Happy to help! :)

[@prakhar_pratyush]

Brilliant...♥️ The way you explain is fantastic...Thanks a lot

[@LucidProgramming]

Thank you, I really appreciate that! :)

[@shahriarshovo3382]

OMg . i was having problem with linked list . and i really didnt understand . but because of you its totally clear . omg ... love you bro ♥

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@shahriarshovo3382]

of course brother ❤️

[@LucidProgramming]

@@shahriarshovo3382 Sincerely appreciated. Thank you! :)

[@aravindhravi9542]

very good understanding and covering atmost every basics that I expected :)

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@Pricestewart]

Very nice work... you make it easy to understand . Thank you.

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@ltmollo6039]

I've finally understood it. Thank you so much

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@anirvansen2941]

This would make it more generic, Thank you for the series, Really helpful class Node: def __init__(self,data): self.data = data self.next = None class LinkedList: def __init__(self): self.head = None def print_list(self): cur_node = self.head while cur_node: print(cur_node.data) cur_node = cur_node.next def append(self,data): #If this is a first node new_node = Node(data) if self.head is None: self.head = new_node return else: last_node = self.head while last_node.next: last_node = last_node.next last_node.next = new_node def prepend(self,data): new_node = Node(data) new_node.next = self.head self.head = new_node def insert_after_data(self,prev_data,data): new_node = Node(data) curr = self.head while curr: if curr.data == prev_data: next_ptr = curr.next curr.next = new_node new_node.next = next_ptr return curr = curr.next l_list = LinkedList() l_list.append('A') l_list.append('B') l_list.append('C') l_list.prepend('Prepend') l_list.prepend('Prepend1') l_list.insert_after_data('A','new_data') l_list.print_list()

[@LucidProgramming]

Nice, thank you for sharing, and thanks as well for watching! Cheers, and have a nice day!

[@ashishgoyal4958]

Thank you so much for making this amazing Data Structures videos.

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@syedafridyhussains504]

Broo...you are really amazing yaar....really loved the content....please post thest kinds of videos

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@prashantmaitra3361]

you are a life saver man.... thanks and love from india

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@bharatapar3937]

18:35 "Draw A Line" .. I Like it !

[@LucidProgramming]

Haha, well you know what I mean :P

[@piotrwln9348]

Great video. You really should have more subscribers!

[@LucidProgramming]

Thank you, Piotr! I hope that others stumble on my content and find it useful :) If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@dadivenkat4213]

Wow. Excellent. I am searching for Data structures using python. This is very helpful. Thanks a lot Lucid Programming. There's a lot of difference using C-language and python. I have an idea how to use C for data structures. I thought of implementing the same way I do in C but in python for example there are push and pop functions for stack operations where as in C you have to re-assign 'top' variable during insertion or deletion. It made bit easy in python if you know the oops concept

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@kewtomrao]

Amazing man!Just amazing!You earned a subscriber!

[@LucidProgramming]

Very flattered, thank you!

[@Ribuan_01]

This has been so helpful, dude. Thank you❤❤❤

[@rjs2583]

thank you for sharing your wonderful talent to the world

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@taralsarvagod9099]

Amazing teaching, amazing channel, amazing videos, amazing explanation. U deserve more subs. But why are you not uploading videos recently?

[@LucidProgramming]

Thanks, Taral, I greatly appreciate that. I would like to dedicate some time in the near future to producing video content again. At the moment, there are a lot of things going on in life that are preventing me from doing so. I hope to get to regular video creation and upload-schedule again soon. Please do subscribe to stay tuned!

[@darshanpahilwani1998]

Amazing explaining method i found it very hard to understand to code after watching your video it become much clearer

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@robn8656]

These videos are great. I always wanted to be a computer programmer but we were poor and I always felt it was impossible without a CS degree. I suspect it's still going to be harder when I send in resumes but I think if I just make sure to really know algorithms and data structures well I might have a chance during the interviews.

[@LucidProgramming]

Now, more than ever, people can be in control of their time and skills. Use this to your advantage and don't place roadblocks in front of your own development! Cheers, and thanks for watching.

[@Meridian-lk2fo]

Great no-BS videos.

[@LucidProgramming]

Thank you, glad that you enjoyed it! :)

[@leonmezu]

Wonderful explanation! thank you very much!

[@LucidProgramming]

Thank you, Leonardo! Thank you for watching!

[@arjunsumanth1394]

Sir iam understand fully 👌👌👌👌💯💯💯💯💯💯💯💯👍👍👍👍👍👍👍👍👍👍

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. I hope to be putting out more similar videos soon!

[@mannuboyina7098]

The best Explanation I got

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@amyraygada6692]

Thanks so much!!! Your explanations were super good :) I really enjoy your videos

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!

[@karthik437]

Hey LucidProgramming, great tutorial on data structures. I have a quick question though. In the initial slides you mentioned for an insertion operation the cost is O(1), but if you look at the append() method you created, you are not achieving the O(1) rather it is O(n)? As you are using a loop and always starting from the head, you are not achieving O(1). Please correct me if I am wrong.

[@LucidProgramming]

Hi Karthik. The operation of appending once you get to the end is O(1), but you're correct in that you'll need to traverse the list first, giving O(n). Sorry for the confusion!

[@keklani]

thank you for your video! i just started learning data structures and i was so confused on how linked lists work, but the visuals and explanation made it easy for me to understand. how would you make a function where you insert before a node?

[@valentynsson5969]

Good one ! Thanks clear explanation.

[@LucidProgramming]

Cheers, thanks for watching!

[@Antonioab-cy1ov]

Another way to get the node object before insert_after_node is called: def get_node_by_distance(self, steps): cur_node = self.head if steps == 0: return cur_node while cur_node: cur_node = cur_node.next steps -= 1 if steps == 0: break return cur_node

[@LucidProgramming]

Cool, thanks for sharing!

[@bijayamanandhar3890]

Great tutorial, great presentation. I wish I could find it long ago!

[@LucidProgramming]

Cheers, thank you very much! I'm glad to hear these videos have been helpful to you! :)

[@gautamnegi9675]

wow! man just wow,so much valuable and info rich content at free of cost,u sir are a #legend

[@anulatasingh7434]

You teach very well . Thanks for the video. :)

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link (www.paypal.me/VincentRusso1) for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@王玮-f6f]

Excellent video.Thank you very much.

[@LucidProgramming]

Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@Sugurous]

Great explanation brother/ Thanks for your teach.

[@lokeshagarwal873]

Nice, Those who want to search and then add the node at specific position. Refer below snippet, def insert_after(self, pos_node, newd): new_node = Node(newd) Not_Exists_Flag = False t = self.Head '''check if the node before which new node to be inserted exists or not''' while t: if t.data == pos_node: print('Node is', pos_node, t) new_node.next = t.next t.next = new_node return else: Not_Exists_Flag = True t=t.next if Not_Exists_Flag == True: print('Node does not exists in Linked List') return

[@LucidProgramming]

Great, thanks for sharing your code! Cheers, and thanks for watching.

[@lokeshagarwal873]

@@LucidProgramming a big thanks to you. .for explaining data structures in such a simple way. ..

[@LucidProgramming]

@@lokeshagarwal873 Thank you! If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@akashvenugopal2489]

Another way to insert a node in the middle by using indexing(i.e In case the linked list is long): def middle(self,index,data): newnode = Node(data) if index>=self.length(): #the length function is to find the total length of the linked list print("Error:index given is larger than range of linked list") return cur_idx = 1 #can be 0 or 1 depending upon you cur = self.head while cur.next!=None: last_node = cur cur = cur.next if index==cur_idx: last_node.next = newnode newnode.next = cur cur_idx+=1

[@LucidProgramming]

Cool thanks for sharing!

[@DungPham-ai]

Thank you. Very useful

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. I hope to be putting out more similar videos soon!

[@vedikajaokar8076]

Explanation by you...is simply amazing. Thank you! Is there a video for MERGE SORT using Python?...if not..then can you plz make a video for the same?...It will be great for us to understand!

[@LucidProgramming]

Thank you! I would like to cover mergesort, but I have not done so yet. If you like my content, I've been working on some projects during the past couple of months. If you would like to stay up-to-date, please consider subscribing to my mail list. Also, if you haven't already, please consider subscribing! I really appreciate the support, and if you want to support the channel, I do have a PayPal link paypal.me/VincentRusso1 for donations that go directly to the creation of content on this channel. I hope that the content I provide there will enhance the videos on my KZbin page. bit.ly/lp_email

[@nachiketdesai5635]

thank you so much 😊

[@LucidProgramming]

You are welcome, and thank you for watching!

[@AdnanF7g]

Here's the link for whole linked list playlist: kzbin.info/aero/PL5tcWHG-UPH2_HEOezeYqtMDoS6dOeNZ6

[@DeepakSingh-sy4ws]

you are too good sir..

[@LucidProgramming]

Thank you, Deepak!

[@pradhvanbisht2177]

You made it so easy to understand :)

[@LucidProgramming]

Very happy to hear that, Pradhvan :). Thanks for your comment, and best of luck in your coding!

[@pradhvanbisht2177]

Thanks just finished the Linked List videos insertion and deletion. Finally understood after wasting an entire day yesterday on a book. Will be completing your Data Structures and Algorithms playlist to prepare for interviews. Keep up the good work 😊

[@LucidProgramming]

That's really great to hear, Pradhvan. I'm very much a visual learner myself, so KZbin is often my go-to for attempting to understand a dry topic in a textbook if at all possible. The data structures and algorithms playlist are under active development, and I hope to continue to add content to those playlists. Cheers, and thanks again for your comment! :)

[@kamaralam8296]

Very nice explanation...👍

[@LucidProgramming]

Thanks, Dexter. Cheers! :)

[@PRABHATKUMAR-sc4qo]

Thank you sir . But I think instead of passing out previous node , the more practical approach should be data after which we want to add the new node. I have done it below , please find it for reference if anyone is interested. def attach_in_between(self,data_after,data_to_add): new_node=Node(data) cur=self.head is_present=False while(cur and not is_present ): if(cur.data==data_after): if(cur.next is not None): new_node.next=cur.next cur.next=new_node is_present=True else: self.append(data) cur=cur.next if(not is_present): print("Data after which we have to insert is not present in linked list")

[@LucidProgramming]

Why is this the "more practical" approach?

[@PRABHATKUMAR-sc4qo]

@@LucidProgramming Because i think someone will provide the node data instead of node itself .

[@LucidProgramming]

@@PRABHATKUMAR-sc4qo But if there are duplicates in the list, your approach fails.

[@PRABHATKUMAR-sc4qo]

@@LucidProgramming Yes, so i guess it all depends on want i wanted to achieve Any way thanks for the response.

[@LucidProgramming]

@@PRABHATKUMAR-sc4qo No problem. Hope that helped!

[@yuvrajrana6437]

hey man from where i can learn complete data structures and algorithms in python?? really struggling

[@LucidProgramming]

I offer tutoring and consulting. Reach out to me via email and I can provide you my schedule and rates!

[@nataliatenoriomaia1635]

Such an awesome video! Thanks! I just have a question: regarding the insert_after_node(), you chose to use llist.head.next instead of "B". But let's say we would like to insert the "E" after "R", in the alphabet sequence. What would the prev_node be in that case? We shouldn't have to write llist.head.next.next.next.next.... . Is there a simple way to do it?

[@nataliatenoriomaia1635]

Ok, I worked on a possible solution, which works by inputing the data of the previous node. (But I guess this would be problematic if there are nodes with same values): def insert_after_node2(self, prev_node_data, data): prev_node = self.head while prev_node.data != prev_node_data: next_node = prev_node.next prev_node = next_node if not prev_node: print("Previous node data is not in the list.") return new_node = Node(data) new_node.next = prev_node.next prev_node.next = new_node

[@gauravpatil7977]

Exactly my question!

[@gabrielade775]

Hi Natalia, were you able to find the solution?

[@mightyprogrammer2899]

@@nataliatenoriomaia1635 This would also work def insert_after(self, key, data): cur = self.head while cur: if cur.next is None and cur.data == key: self.append(data) return elif cur.data == key: new_node = Node(data) nxt = cur.next new_node.next = nxt cur.next = new_node cur = cur.next

[@michellegray134]

Very helpful! Thank you

[@LucidProgramming]

Cheers! If you enjoyed and benefited from my content, please consider liking the video and subscribing to the channel for more content like this. If you would like to support the content creation on this channel please consider unblocking ads when watching my videos as this is how I support my time to make content. I hope to be putting out more similar videos soon!