Binary Search Trees

• When removing a node with only one child, the child replaces the node to be removed
• When removing a node with two children, replace it with the smallest node of the right subtree