Reverse a linked list. After presenting a solution I was asked to provide a recursive method.
Sigiloso
Node ReverseLinkedList(Node head) { Node next = head.next; if (next == null) { return head; } Node revList = ReverseLinkedList(head.next); next.next = head; head.next = null; return revList; }