Skip to main content

Print a Linked List in Reverse Order | Linked List | Java | MyCodingNetwork

 


Print a Linked List in Reverse Order


After mastering the four standard operations on a Linked List - Creation, Traversal, Insertion, and Deletion - we will now proceed to the next topic: 'Printing a Linked List in Reverse Order'. It serves as a continuation of our previous discussions. We will build upon the topics and ideas that we have previously explored to further our understanding about Linked List.

We 'll be using recursive approach for the implementation. For this a separate recursive function would be needed. Concept of stack is also implemented for print statement. Let's discuss the algorithm for the same:

Algorithm:

  1. Create a function printReverse(), which takes 'head' of the Linked List as the parameter.
  2. Take a temporary node 'cur' and assign it with the head of the list.
  3. Create a base case which checks if cur==null.
  4. If base case is TRUE, then function would return.
  5. If base case is FALSE, then the statements following that base case would be executed.
  6. Function call statement is defined which contains pointer to the next node.
  7. Following the function call statement there is a print statement, which would be executed after base case is TRUE, in LIFO manner.

Source Code:



Time Complexity: The time complexity of the function is `O(n)`, where `n` is the number of nodes in the linked list. This is because the function `printReverse` is called recursively for each node in the list until it reaches the end. Each recursive call takes constant time, so the overall time complexity is linear in the number of nodes.

Full Source Code: Code | Reverse Order Printing of Linked List (mycodingnetwork.blogspot.com)

Output: 



Video Reference:





Hope you liked this explanation, for any doubt/feedback/improvements/corrections you can comment down in the comment section.

Labels:

Popular posts from this blog

Bubble Sort | Java & Python | MyCodingNetwork | Alok Tripathi

  Bubble Sort is a simple sorting algorithm that works by repeatedly comparing and swapping adjacent elements in an array until they are in the correct order. It is called bubble sort because the smaller elements "bubble" to the top of the array, while the larger elements sink to the bottom. Quick Video Explanation: How Bubble Sort Works Bubble sort works by iterating through the array from left to right and comparing each pair of adjacent elements. If the element on the left is larger than the element on the right, they are swapped. This way, the largest element in the array moves to the rightmost position in each iteration. This process is repeated until no more swaps are needed, which means the array is sorted. To illustrate how bubble sort works, let's use the example of sorting the array [30,90,50,10,40] in ascending order. First Iteration/Pass: The first step is to compare the first two elements, 30 and 90. Since 30 is smaller than 90, they are already i
Discover More »

Insertion and Deletion of a Node in Linked List | Java | MyCodingNetwork

  Insertion of a new node & Deletion of an existing node After an exhilarating commencement of the Linked List series, in this post, we'll be exploring the artistry behind insertion and deletion operations in linked list. So let's now move on to the second problem statement of the series, i.e., write two functions for insertion and deletion of a node respectively, from linked list . Algorithm for inserting a node at pos position: Create a function insert () which takes head of the node, pos and the new node as the parameter. Take a base case, if pos==1, means the new node is to be made the head of the linked list. If the above case is not true, traverse the linked list and reach to position, pos-1 . Assign the new node with the address of the node at pos. Finally, assign the node at pos-1 with address of new node. Algorithm for deleting a node at pos position: Create a function deletion () which takes pos and the head of the LinkedList as parameter. Base case, if pos
Discover More »

Time Complexity in One Shot | MyCodingNetwork

  After exploring various aspect of programming, it's important to understand and calculate the amount of time our code takes to execute for a given size of input. The concept needed for this is called Time Complexity. In this article we will be exploring various aspects of Time Complexity and also solve numerous questions on it, so that we can have strong foundation of one of the most important aspect in the world of DSA. Introduction For a beginner the first question that should come to his/her mind is, "what is time complexity?". The answer is pretty simple, it is a measure of the amount of time an algorithm takes to complete as a function of the size of the input . It is important to analyze the time complexity of an algorithm because it helps us to compare different solutions and choose the most efficient one for a given problem.  In simple words (just to understand), one way to measure the time complexity of an algorithm is to count the number of iterations it perfo
Discover More »