1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
DELETING FROM A BINARY TREE.
4 cases to consider, although some may be handled by the same strategy:
1) Node is a leaf.
2) Node has a left child only.
3) Node has a right child.
4) Node has two children.
Case 1 is obviously simple:
Case 1. Delete a leaf (node with 0 children).
Easy: (a) Find node’s address and store it.
(b) Set parent’s pointer to NULL.
(c) delete leaf node.
Case 2: Node has a left child only.
Want to dispose of parent, but keep left child (and any of its children).
Case 3: Node has a right child only.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 199 ‐