A Common-Sense Guide to Data Structures and Algorithms

the algorithm for deletion from a binary tree is: • If the node being deleted has no children, simply delete it. • If the node being deleted has one child, delete it and plug the child into the spot where the deleted node was. • When deleting a node with two children, replace the deleted node with the successor node. The successor node is the child node whose value is the least of all values that are greater than the deleted node.–If the successor node has a right child, after plugging the successor node into the spot of the deleted node, take the right child of the successor node and turn it into the left child of the parent of the successor node.