of node but this will increase the height of the treewhich we will see later causes the tree operations to be less efficient figure attempting to remove an interior node with two children by replacing the node with one of its children the keys in binary search tree are arranged such that an inorder traversal produces sorted key sequence thuseach node has logical predecessor and successor for node its predecessor is node and its successor is node as illustrated in figure instead of attempting to replace the node with one of its two childrenwe can replace it with one of these nodesboth of which will either be leaf or an interior node with one child since we already know how to remove leaf and one-child interior nodethe one selected to replace node can then easily be removed from the tree removing an interior node with two children requires three steps find the logical successorsof the node to be deletedn copy the key from node to node remove node from the tree predecessor successor figure the logical successor and predecessor of node