1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
2. A right rotation.
Suppose we begin with the following AVL tree.
2 6
8
4 9
Now suppose that we want to insert the value 3.
If we do a normal insert, we now have a problem, because the resulting tree is
not an AVL tree.
8 (‐2)
4 (‐1) 9
2 (1) 6
3
To correct this situation, we need to do a right rotation of 8.
This requires:
(1) 4 is promoted, replacing 8.
(2) This orphans 4’s right child (6), but:
(3) 8 becomes 4’s right child and adopts 6 as a left child
This yields the following tree:
4
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 204 ‐