In a binary search tree, if the deleted node has both left and right child, you always promote the inorder successor of the deleted node to replace the deleted node. So it will be right child's left most descendent. If right child is null, promote left child.