Reverse Linked List

re.js

function re (node, prevNode) {
  node.next = prevNode.id
  const prePreNode = findPrev(prePreNode)
  if (prePreNode === null) {
    prevNode.next = null
  } else {
    re(prevNode, prePreNode)
  }
}

function findPrev (node) {
  // something happens
}

// exec
re ({id: 0, next: null} /* the last node */, {id: 1, next: 0} /* next to the last node */)

// steps
{id: 2, next: 1} {id: 1, next: 0} {id: 0, next: null}
=>
{id: 2, next: 1} {id: 1, next: 0} {id: 0, next: 1}
=>
{id: 2, next: 1} {id: 1, next: 2} {id: 0, next: 1}
=>
{id: 2, next: null} {id: 1, next: 2} {id: 0, next: 1}