Concepts Used

Linked list,recursion.

Difficulty Level


Problem Statement :

Given pointer to the head node of a linked list, the task is to reverse the linked list.

See original problem statement here


Assume that we have linked list 1 → 2 → 3 → Ø, 
we have to change it to Ø ← 1 ← 2 ← 3.


Approach 1(Iterative approach):

While you are traversing the list, change the current node’s next pointer to point to its previous element. Since a node does not have reference to its previous node, you must store its previous element beforehand. You also need another pointer to store the next node before changing the reference. Do not forget to return the new head reference at the end!

struct Node* Reverse(Node *head)
    Node *tail, *t;
    tail = NULL;
    while (head != NULL)
        t = head->next;
        head->next = tail;
        tail = head;
        head = t;
    return tail;
     // Complete this method
 public static Node reverseLinkedList(Node currentNode)
        // For first node, previousNode will be null
        Node previousNode=null;
        Node nextNode;
            // reversing the link
            // moving currentNode and previousNode by 1 node
        return previousNode;

Approach 2(Using recursion):

We can refer some online programming courses and find it easier to start from the bottom up,by asking and answering tiny questions:

  1. What is the reverse of NULL? NULL.

  2. What is the reverse of a one element list?The element itself.

  3. What is the reverse of an n element list? The reverse of the second element followed by the first element.

Refer to commented implementation

     Node Reverse(Node head) {

       /* We have two conditions in this if statement.
       This first condition immediately returns null
       when the list is null. The second condition returns
        the final node in the list. That final node is sent
        into the "remaining" Node below.

       if (head == null || == null) {  
             return head;  

     /* When the recursion creates the stack for A -> B -> C
       (RevA(RevB(RevC()))) it will stop at the last node and
        the recursion will end, beginning the unraveling of the
        nested functions from the inside, out. 

        Node remaining = Reverse(;

     /* Now we have the "remaining" node returned and accessible
      to the node prior. This remaining node will be returned
      by each function as the recursive stack unravels.

      Assigning head to where A is the head
      and B is after A, (A -> B), would set B's pointer to A,
      reversing their direction to be A <- B.
      -----------------------------------------------------*/ = head; 

      /* Now that those two elements are reversed, we need to set
      the pointer of the new tail-node to null.
      -----------------------------------------------------*/ = null;  

      /* Now we return remaining so that remaining is always
      reassigned to itself and is eventually returned by the
      first function call.

      return remaining; 


 #include <bits/stdc++.h>
     using namespace std;
    struct node{
    int data;
    node* next;
     node* newnode(int x)
    node* temp=new node();
    return temp;
    node* reverse(node* head)
     if(head==NULL||head->next==NULL)return head;
    node* restlist=reverse(head->next);
     return restlist;
    int main()
    //write your code here
    int t;cin>>t;
    int n;
    int x;cin>>x;
    node* temp=newnode(x);
    node* head=temp;
    for(int i=1;i<n;i++)
      int x;cin>>x;
    node* head1=reverse(temp);
      cout<<head1->data<<" ";
     return 0;
     import java.util.*;
    public class Main{
    static class SinglyLinkedListNode {
        public int data;
        public SinglyLinkedListNode next;
        public SinglyLinkedListNode(int nodeData) {
   = nodeData;
   = null;
    static class SinglyLinkedList {
        public SinglyLinkedListNode head;
        public SinglyLinkedListNode tail;

        public SinglyLinkedList() {
            this.head = null;
            this.tail = null;

        public void insertNode(int nodeData) {
            SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);

            if (this.head == null) {
                this.head = node;
            } else {
       = node;

            this.tail = node;
    static void printLinkedList(SinglyLinkedListNode head)
        SinglyLinkedListNode temp=head;
            System.out.print(" ");
    static SinglyLinkedListNode reverseLinkedList(SinglyLinkedListNode head) {
        SinglyLinkedListNode prev = null;
        SinglyLinkedListNode current = head;
        SinglyLinkedListNode next = null;
        while (current != null) {
            next =;
   = prev;
            prev = current;
            current = next;
        head = prev;
        return head;


    private static final Scanner scanner = new Scanner(;

    public static void main(String[] args) throws IOException {
        int testCases = scanner.nextInt();

        while (testCases-- > 0) {
            SinglyLinkedList llist = new SinglyLinkedList();

            int llistCount = scanner.nextInt();

            for (int i = 0; i < llistCount; i++) {
                int llistItem = scanner.nextInt();





Previous post AMAN RELATIVES
Next post Character Combine

Leave a Reply

Your email address will not be published. Required fields are marked *