BST Delete
← Back to Binary Search Trees
Three cases: leaf (just remove), one child (replace with child), two children (replace with in-order successor or predecessor, then delete that). O(log n) average.
← Back to Binary Search Trees
Three cases: leaf (just remove), one child (replace with child), two children (replace with in-order successor or predecessor, then delete that). O(log n) average.