reverse linkedlist done recursively

Author: Ram swaroop

src/me/ramswaroop/linkedlists/ReverseList.java

@@ -12,6 +12,11 @@
  */
 public class ReverseList<E> extends SingleLinkedList<E> {
 
+    /**
+     * Reverses the linked list using 3 references prev, curr and next.
+     *
+     * @param node
+     */
     public void reverseList(SingleLinkedNode<E> node) {
         SingleLinkedNode<E> prev = node;
         SingleLinkedNode<E> curr = node.next;
@@ -25,6 +30,27 @@ public void reverseList(SingleLinkedNode<E> node) {
         head = prev;
     }
 
+    /**
+     * Recursive method to reverse a linked list.
+     *
+     * @param node
+     * @return
+     */
+    public SingleLinkedNode<E> recursiveReverseList(SingleLinkedNode<E> node) {
+        if (node == null) return null;
+
+        SingleLinkedNode<E> nextNode = recursiveReverseList(node.next);
+
+        if (nextNode == null) {
+            head.next = null; // head will be the last node so head.next = null;
+            head = node;
+        } else {
+            nextNode.next = node;
+        }
+
+        return node;
+    }
+
     public static void main(String a[]) {
         ReverseList<Integer> linkedList = new ReverseList<>();
         linkedList.add(11);
@@ -35,5 +61,7 @@ public static void main(String a[]) {
         linkedList.printList();
         linkedList.reverseList(linkedList.getNode(0));
         linkedList.printList();
+        linkedList.recursiveReverseList(linkedList.getNode(0));
+        linkedList.printList();
     }
 }