Lesson 14 of 18 • 3 upvotes • 10:27mins
This lesson explains how to print a linked list in reverse order using recursion. Recursive function reverse_print is explained with the help of an illustration and its simulation is shown using run-time stack and activation record.
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