21.Reverse Traversal of Linked List The One Where Aarav Wants a “Back Button” in Real Life

hello everyone

Today’s DSU lab started with a very heavy dialogue from sir: “Create a singly linked list and print it in reverse using recursion.” Before anyone could even react, Aarav sighed dramatically and said: “Why can’t life also have a reverse button?” Rahul didn’t miss a beat: “Bro, forget your life. Reverse the linked list first.” And that’s how chaos began.

What’s Going On Here?

A singly linked list normally moves forward-only just like Aarav walking into problems. So printing it in reverse is tricky because there’s no backward pointer. But Rahul, our group’s human CPU, explained: Use recursion, Travel all the way to the end of the list, Then, while, coming back, print each node’s data, No pointer reversal, No extra arrays, Just pure recursion magic, Aarav summed it up confidently: “Means the function goes ahead but the printing comes back?” Honestly, he’s slowly becoming dangerous.

How We Played Our Roles

• Rahul built the linked list and the recursion logic
  (and kept flexing that recursion is “just stack behavior, bro”)

• Aarav kept asking if he could reverse his exam marks the same way
  (sadly, no)

• I (Daksh) displayed the output and pretended I wasn’t losing my mind

Why This Program Is Fun

• The list remains completely unchanged

• Recursion handles everything automatically

• No need for complex pointer manipulations

• Makes you feel like you’re doing black magic in C

And the best part? Aarav started calling it the “Reverse Playback Linked List.” Someone please stop him.

Code:

 #define _CRT_SECURE_NO_WARNINGS
 #include <stdio.h>
 #include <stdlib.h>
 
 struct Node {
     int data;
     struct Node* next;
 };
 
 struct Node* createNewNode(int dataValue) {
     struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
     newNode->data = dataValue;
     newNode->next = NULL;
     return newNode;
 }
 
 void insertNodeAtEnd(struct Node** headReference, int dataValue) {
     struct Node* newNode = createNewNode(dataValue);
     if (*headReference == NULL) {
         *headReference = newNode;
         return;
     }
     struct Node* temporaryNode = *headReference;
     while (temporaryNode->next != NULL)
         temporaryNode = temporaryNode->next;
     temporaryNode->next = newNode;
 }
 
 void printListInReverse(struct Node* headReference) {
     if (headReference == NULL)
         return;
     printListInReverse(headReference->next);
     printf("%d ", headReference->data);
 }
 
 int main() {
     struct Node* headReference = NULL;
     int numberOfNodes, dataValue;
     printf("Enter number of nodes: ");
     scanf("%d", &numberOfNodes);
 
     for (int index = 0; index < numberOfNodes; index++) {
         printf("Enter data for node %d: ", index + 1);
         scanf("%d", &dataValue);
         insertNodeAtEnd(&headReference, dataValue);
     }
 
     printf("Nodes in reverse order: ");
     printListInReverse(headReference);
     printf("\n");
     return 0;
 }

Output:

← Previous

🏠 Homepage

Next Chapter →