reverse linked list

rev_linked_list.js

//
// Recursively change each node of the linked list such that next
// is the last node seen during a linear scan of the linked list.
//
let reverseList = head => {
    let go = (node = head, last = null) => {
        let next = node.next;
        node.next = last;
        if (!next)
            return node;
        return go(next, node);
    };
    return head ? go() : null;
};