Data Structures and Algorithms | Reverse Linked List | Java | Teckieshare

Linked List is a sequence of links with contains items. Each link contains a connection to another link.
Example
1 - 2 - 3 - 4 - NULL

A Reverse linked list is a linked list created to form a linked list by reversing the links of the list. The head node of the linked list will be the last node of the linked list and the last one will be the head node.

Example
Reverse linked list formed from the above linked list −

4 - 3 - 2 - 1 - NULL

To reverse the given linked list we will two kinds of approaches.

1. With Extra Memory Space - Iterative Method
2. Without Extra Memory Space - Iterative Method

In this video, I'm going to explain, the following chapters,

Chapters:
0:47 Iterative Method With O(n) Extra Memory Space
5:15 Approach - I Time Complexity and Space Complexity
6:02 Iterative Method with O(1) Extra Memory Space
8:42 Approach - II Time Complexity and Space Complexity

source code ? https://github.com/im-mani-teckieshare/data-structure-algorithm-java

Learn Data Structures and Algorithms easily for beginners.
Understand Data Structures and Algorithms theory concept from coding.

? Subscribe for more Data Structures and Algorithms videos
https://www.youtube.com/TeckieShare?sub_confirmation=1

▶️ Data Structures and Algorithms playlist
https://www.youtube.com/playlist?list=PLzrz9JdfZNJddnwbQhHT-4OV9SXFgtTHH

▶️ Linked List Data Structures
https://youtu.be/5LyU-wgf1YQ

▶️ Doubly Linked List Data Structures
https://youtu.be/fBAGG8EOg0c

? Follow us on Facebook
https://www.facebook.com/teckieshare/

Let us share our knowledge to all ??
#LinkedList #reverseLinkedList #Teckieshare