[prev] 10 [next]

Exercise 1: Deletion from Search Trees

Implement the deletion function

BSTree BSTreeDelete(BSTree t, Key k)

which returns a new tree that does not contain k.

Can be done recursively ...

But eventually we need to remove the root of some subtree.