In a binary search tree, when you delete a node, you've got to replace it with the inorder successor of the deleted node, so that the resulting tree is still binary-searchable.