Reverse linked list recursive

Problem

Reverse a linked list

Solution

We will solve this by recursion. We will reverse the first link and leave the rest of the reversing on the recursion.

Code

public class ReverseLinkedListRecursive
{
 public static void main(String[] args)
 {
  Node a=new Node(4);
  Node b=new Node(6);
  Node c=new Node(2);
  Node d=new Node(9);
  Node e=new Node(5);
  Node f=new Node(3);
  Node g=new Node(6);
  Node h=new Node(2);
  a.next=b;
  b.next=c;
  c.next=d;
  d.next=e;
  e.next=f;
  f.next=g;
  g.next=h;
  a.printLinkedList();
  Node head=reverseLinkedList(a);
  head.printLinkedList();
 }
 public static Node reverseLinkedList(Node head)
 {
  if(head.next==null)
   return head;
  Node newHead=reverseLinkedList(head.next);
  head.next.next=head;
  head.next=null;
  return newHead;
 }
 static class Node
 {
  public Node next;
  public int value;

  public Node(int value)
  {
   this.value = value;
  }
  public void printLinkedList()
  {
   Node head=this;
   while (head != null)
   {
    System.out.print(head.value + "->");
    head = head.next;
   }
   System.out.println();
  }

 }
}