Reversion of Linked Lists

gistfile1.txt

private static Node reverseLinkedListByRecursion(Node node) {
    if (node == null || node.next == null) {
        return node;
    }
    Node rest = node.next;
    rest = reverseLinkedListByRecursion(rest);
    node.next.next = node;
    node.next = null;
    return rest;
}

private static Node reverseLinkedListByWhile(Node node) {
    Node current = node;
    Node prev = null;
    Node next;
    while (current != null) {
        next = current.next;
        current.next = prev;
        prev = current;
        current = next;
    }
    return prev;
}