Recursive Linked List from Scratch

preview_player
Показать описание
In our second video of our linked list series, we analyze how to implement a singly linked list recursively that supports adding a new value, printing the list, and searching for an existing value.

In this video we cover:
0:27 - Learning objectives
0:55 - Implementing a linked list
1:40 - Appending to a linked list
8:23 - Printing a linked list
14:38 - Contained in a linked list
19:11 - Practice problem: sum list
26:11 - Recap

Рекомендации по теме
Комментарии
Автор

I like his tut, always detail explains and always 2 methods, and always explain with graph and move the arrow pointer step by step, and always could clear my confused. Thanks.

havefun
Автор

Thank you for your detailed explanations and helpful tutorials. I truly appreciate your efforts. The animations in your tutorials are especially beneficial for visual learners like myself. Could you please share:

1. The application you use for writing over VSCode?
2. The software you use to create the illustrations of the linked list?
3. How you split the screen to show both VSCode and the illustrations simultaneously?
Thank you once again!

ib
Автор

Keep it going back man!
This videos are awesome

veljkoblagojevic
Автор

Nice video. Is the series on DS&A now concluded?

hardXcoreminecraft
Автор

It's typically considered a good idea to keep a tail reference for example to insert at the end of the list. Is there any such use in keeping a tail pointer in a recursive implementation also in your opinion?

amnahmahmood
Автор

@7:40 you do not need to check if this.head === null. You can remove that whole if condition.That case will be handled by _append method

jainildodia
Автор

Alvin, you're a great teacher. You have a new stalker i mean follower ;)

CritiKaster