Data Structures: Linked Lists

[wolfferoni]

You know that moment of satisfaction when you finally understand something? I got it from this video. I've spend so much time watching my lectures, looking at tutorials and explanations of LinkedLists and never really understood it. I decided to write you the code and try to explain to myself what each line meant and when I got stuck, listened to you explain it with the little diagrams and finally(!) understand what on earth this node and head and next thing means. THANK YOU.

[eliastefera]

This is probably the best video you can find on YouTube that talks about LinkedList. Great job!

[grace]

Gayle, if you ever see this, I really love the way this mini lesson is organized and delivered. Very helpful I thank you I am passing a class because of you!!!

[SenLan-oh]

You know that moment of satisfaction when you finally understand something? I got it from this video.

[MannyGonzalezReyna]

Thanks so much for putting the algorithm and the coding together on the same page, that's the best way to learn any coding language.

[khatharrmalkavian]

Any conversation about linked lists should BEGIN with the following warning:

"You probably shouldn't be using a linked list for this."

[elbuhdai]

Thank you so much. The visual representation that changes with each new line of code is so helpful for a concept like this. Code for nodes can often look kind of cryptic without a visual representation of how things move.

[nkeiruw]

I've never watched a programming video from beginning to end before. A truly class explanation. Thank you!

[moneytree]

Appending a node to a linked list doesn't have to be O(n) if we keep track of the `tail` node as well as the `head` node. But very well done explanation as usual, Gayle! Your content are always such confidence boosters!!

[saindst]

The one thing I have come to find out about all these data structure explainations on youtube is that only a hand few will ever give you an actual REAL life damn example of where and HOW it is used so you can actually make sense of it all. It makes a HUGE, a difference.

[Fivousix]

Great videos, I have been watching some and I really like the way you draw at the same time you show the code. They are short and straight to the point.

I would just like to point out for future viewers that in C/C++ if you do not explicitly delete those nodes memory will be leaking.

[kidou]

The wrapper class of LinkedList dynamically changes the head by prepending to inform other "lists" pointers. This is really neat! Thank you!

[segintendorocks]

This girl is amazing. Thanks for the fantastic tutorial :D.

[francis-comedy-club]

of all the "LinkedList" videos I've watched, None can be compared to this. Thank you for this explanatory video 🥳🥳🥳🥳🥳🥳🥳🥳🥳

[asivaprasadam]

Minor correction with the function:
deleteWithValue (int data);
Change: Move the special case if statement completely to the end of the while loop.
Reasoning: If the head and the next node has the same value and equals the data value. The next element won't be deleted. So the special case should be after the while loop. Correct me if I'm wrong.

Example data for the original function to fail : 10, 10, 20, 39, 48, ... data = 10

[guptayash]

The deleteWithValue(int data) function will throw NullPointerException when the element does not exist in the LinkedList.
For Example, LinkedList: 7 (List has only one Node, I.e. only head node with value 7)
And, you try to delete the node with value 5.

[gnanasekaranebinezar]

I have been looking for crystal clear explanation to algorithms such a long time. Finally I landed up on right place. What a diligent explanation. Learned a lot. Splendid. No words to appreciate further.

[nitishmehta]

Really amazing tutorial on Linked lists, thank you!! Just want to add why accessing array is faster because its elements are always stored in contiguous memory locations this is kind of its disadvantage also as you need to have in advance that contiguous chunk of memory in advance. Feel free to correct me if I am wrong.

[markkfitx]

This is one of the few videos that I found does not make the topic more confusing. Thanks so much

[Buebrowndj]

Excellent, easy to digest explanations and 0 ads. Thank you for your content <3.