Deletion in binary search tree

Question

Explain how deletion is performed in the binary search tree.

Answer 1

The three processes are described below:

a) If the node is a leaf, then it can be deleted instantly.

b) If the node consists of one child then the node can be deleted after its parent adjusts a pointer to bypass node.

c) If the node consists of two children the general strategy is to substitute the data of this node with the smallest data of the right sub tree and recursively delete the node that is empty.