When removing an element from a binary search tree that is a leaf, ______________ will ensure that the resulting tree is still a binary search tree.
A) replacing it with its only child
B) replacing it with its inorder successor
C) simply deleting it
D) all of the above
E) neither a, b, nor c

Question

Quizplus · Accepted Answer

If the element that we wish to remove is a leaf, then simply deleting it will ensure that the resulting tree is still a binary search tree.

When Removing an Element from a Binary Search Tree That