Reverse a singly linked list

ReverseLinkedList.java

Node reverse(Node n) {
  // maintain previous node, rewriting all pointers to previous
    Node prev = null;
    while(n != null) {
        Node next = n.next;
        n.next = prev;
        prev = n;
        n = next;
    }

    return prev;
}