BST Delete

pseudocode

delete(node, value)
  if value < node.value: node.left = delete(node.left, value)
  else if value > node.value: node.right = delete(node.right, value)
  else if node found:
    if 0 or 1 child: splice it out, return the remaining child
    else: node.value = min(node.right); node.right = delete(node.right, node.value)
  return node