# Write a recursive function to print reverse of a Linked List

Given a linked list, print reverse of it using a recursive function. For example, if the given linked list is 1->2->3->4, then output should be 4->3->2->1.

Note that the question is only about printing the reverse. To reverse the list itself see this

Difficulty Level:
Rookie

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Algorithm

```printReverse(head)
1. call print reverse for hed->next
```

Implementation:

## C

```// C program to print reverse of a linked list
#include<stdio.h>
#include<stdlib.h>

struct Node
{
int data;
struct Node* next;
};

/* Function to reverse the linked list */
{
// Base case
return;

// print the list after head node

// After everything else is printed, print head
}

/*UTILITY FUNCTIONS*/
/* Push a node to linked list. Note that this function
void push(struct Node** head_ref, char new_data)
{
/* allocate node */
struct Node* new_node =
(struct Node*) malloc(sizeof(struct Node));

/* put in the data  */
new_node->data  = new_data;

/* link the old list off the new node */

/* move the head to pochar to the new node */
}

/* Drier program to test above function*/
int main()
{
// Let us create linked list 1->2->3->4

return 0;
}
```

## Java

```// Java program to print reverse of a linked list
{

class Node
{
int data;
Node next;
Node(int d) {data = d; next = null; }
}

/* Function to print reverse of linked list */
{

// print list of head node

// After everything else is printed
}

/* Utility Functions */

/* Inserts a new Node at front of the list. */
public void push(int new_data)
{
/* 1 & 2: Allocate the Node &
Put in the data*/
Node new_node = new Node(new_data);

/* 3. Make next of new Node as head */

/* 4. Move the head to point to new Node */
}

/*Drier function to test the above methods*/
public static void main(String args[])
{
// Let us create linked list 1->2->3->4
llist.push(4);
llist.push(3);
llist.push(2);
llist.push(1);

}
}
/* This code is contributed by Rajat Mishra */
```

Output:
`4 3 2 1`

Time Complexity: O(n)

# GATE CS Corner    Company Wise Coding Practice

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.
1.4 Average Difficulty : 1.4/5.0
Based on 155 vote(s)