Reverse Linked List

/*********** Recursion ***************/

private Node reverseList(Node root) {
if (root.next == null) {
return root;
} else {
Node tail = reverseList(root.next);
root.next.next = root;
root.next = null;
return tail;
}
}

/************* Iteration ***************/

private Node reverseIte(Node head) {
Node remaining = null;
Node previous = null;

while (head != null) {
remaining = head.next;
head.next = previous;
       previous = head;
       head = remaining;
}
return previous;
}