Lesson 4 of 18 • 7 upvotes • 9:54mins
The lesson begins with an explanation of the creation of a linked list. It then highlights on how we can insert a node at the beginning of a linked list and what to do if the list is empty. There are multiple illustrations that help in a better understanding of the concept.
18 lessons • 2h 50m
Data Structures - Introduction & Goals
6:33mins
Linked List - Introduction
8:55mins
Linked List: Implementation(C++)
9:31mins
How To Insert A Node At The Beginning Of A Linked List
9:54mins
Data Structures: Inserting A Node At The End Of A Linked List
9:55mins
Basic Data Structures: Print A Linked List
7:11mins
Data Structures: Insert A Node At The Nth Position Of A Linked List
10:29mins
Data Structures: Deleting A Node From Beginning Of The List
6:08mins
Delete A Node From The Ending Of The List
10:29mins
Delete The Nth Node From The Linked List
10:00mins
Reversing A Linked List (Iterative Method)
9:13mins
Intuition Behind Recursion Part 1
10:00mins
Intuition Behind Recursion Part 2
10:30mins
Print A Linked List In Reverse Order
10:27mins
Reversing A Linked List Recursively
9:58mins
Introduction To Doubly Linked List
9:58mins
Implementation Of Doubly Linked List In C++
10:32mins
Traversal In Doubly Linked List
10:31mins