How we can delete a node with two Childs in a binary search tree-00008
This subjective question is related to the book/course
vu acc311 Fundamentals of Auditing.
It can also be found in
vu acc311 Mid Term Solved Past Paper No. 1.
Question 1: How we can delete a node with two Childs in a binary search tree using its right sub tree.
Answer:
The node to be deleted has either left child (sub-tree) or right child (sub-tree). In this case we bypass the node in such a way that we find the in-order successor of this node and then link the parent of the node to be deleted to this successor node. Thus the node was deleted. (Page 263)
