Binary Search Tree Removals – Delete Nodes with 0, 1, or 2 Children
So there are three types of deletions... Is it a leaf with zero children? Is it a node with one child? Or is it a node with two children? Each type of node is deleted in a different way... For the hardest type we use the in-order successor.
