Design another algorithm to remove items from a binary search tree. This algorithm differs from the one described in this chapter when a node N has two children. First let N's right child take the place of the deleted node N in the same manner in which you delete a node with one child. Next reconnect N's left child (along with its sub tree, if any) to the left side of the node containing the in order successor of the value in N.