Please Login To Continue
Traversal In Doubly Linked List
Lesson 18 of 18 • 1 upvotes • 10:31mins
Abhishek Sehgal
This lesson explains how we can traverse a doubly linked list. Both traversal forward (using next pointer) and backward (using the previous pointer) are explained with the help of an illustration. This lesson is for all the people looking to learn data structures in Computer Programming.
In-depth And Comprehensive Detail On The Study Of Basic Data Structures
18 lessons • 2h 50m
1
Data Structures - Introduction & Goals
6:33mins
2
Linked List - Introduction
8:55mins
3
Linked List: Implementation(C++)
9:31mins
4
How To Insert A Node At The Beginning Of A Linked List
9:54mins
5
Data Structures: Inserting A Node At The End Of A Linked List
9:55mins
6
Basic Data Structures: Print A Linked List
7:11mins
7
Data Structures: Insert A Node At The Nth Position Of A Linked List
10:29mins
8
Data Structures: Deleting A Node From Beginning Of The List
6:08mins
9
Delete A Node From The Ending Of The List
10:29mins
10
Delete The Nth Node From The Linked List
10:00mins
11
Reversing A Linked List (Iterative Method)
9:13mins
12
Intuition Behind Recursion Part 1
10:00mins
13
Intuition Behind Recursion Part 2
10:30mins
14
Print A Linked List In Reverse Order
10:27mins
15
Reversing A Linked List Recursively
9:58mins
16
Introduction To Doubly Linked List
9:58mins
17
Implementation Of Doubly Linked List In C++
10:32mins
18
Traversal In Doubly Linked List
10:31mins
Crack Programming with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
