1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Likewise, the following is NOT an AVL tree. Note that negative values arise
when the left sub‐tree is taller than the right sub‐tree.
B
A C
F (1 – 3 = ‐2)
D G
F
On the other hand, although not perfectly balanced the following is an AVL tree.
Balances of 0 are not shown.
10 (‐1)
5 (‐1) 15 (‐1)
3 (‐1) 6 (1) 13 (‐1) 20
2 (‐1) 4 8 12
1
C. Node rotation.
In order to maintain an AVL tree as an AVL tree, the normal insertion and
deletion algorithms have to be supplemented with “node rotation” procedures.
There are right rotations, left rotations and double rotations.
1. A left rotation.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 202 ‐