Create a singly linked list of n nodes and display it in reverse order C

Required knowledge

Basic C programming, Functions, Singly Linked List, Dynamic memory allocation

Algorithm to reverse a Singly Linked List

C program to display numbers in reverse order using single linked list

---

Linked lists use dynamic memory allocation and are collection of nodes.

Nodes have two parts which are data and link.

C program to display a Linked List in Reverse

Display a linked list in reverse: Here, we are going to implement a C program to display the linked list in reverse using recursion.
Submitted by Radib Kar, on December 25, 2018

Problem statement: Write a program to display the linked list in reverse order. Note that the original linked list will not change.

Solution

1. Create and build the linked list
2. Display the original linked list
3. Display in reverse order

Displaying in reverse order can be done using recursive function.

Function reverse_display(node) IF (node!= NULL) reverse_display(node->next) display node value END IF

Example with Explanation:

Let's check how the program runs...

Let the input linked list to be: 1->2->3->4->NULL with head at 1

In Main() it calls reverse_display(1) ---------------------------------------------------------------- reverse_display(1): node is not null reverse_display(1->next) thus it calls reverse_display(2) ---------------------------------------------------------------- reverse_display(2): node is not null reverse_display(2->next) thus it calls reverse_display(3) ---------------------------------------------------------------- reverse_display(3): node is not null reverse_display(3->next) thus it calls reverse_display(4) ---------------------------------------------------------------- reverse_display(4): node is not null reverse_display(4->next) thus it calls reverse_display(NULL) ---------------------------------------------------------------- reverse_display(NULL): node is null no further call, control returned to reverse_display(4) ---------------------------------------------------------------- At reverse_display(4) Control returned from reverse_display(4->next) So it prints the node value that is 4 Control returns to reverse_display(3) ---------------------------------------------------------------- At reverse_display(3) Control returned from reverse_display(3->next) So it prints the node value that is 3 Control returns to reverse_display(2) ---------------------------------------------------------------- At reverse_display(2) Control returned from reverse_display(2->next) So it prints the node value that is 2 Control returns to reverse_display(1) ---------------------------------------------------------------- At reverse_display(1) Control returned from reverse_display(1->next) So it prints the node value that is 1 Control returns to Main function Thus it displays 4 3 2 1