AVL Rotation.ppt
AVL Rotation.ppt
AVL ROTATIONS ARE OPERATIONS USED IN AVL TREES (A TYPE OF SELF-BALANCING BINARY SEARCH TREE) TO
MAINTAIN BALANCE AFTER INSERTION OR DELETION. AVL TREES MAINTAIN A STRICT BALANCE: FOR ANY
NODE, THE HEIGHTS OF THE LEFT AND RIGHT SUBTREES CAN DIFFER BY AT MOST 1.
BALANCE FACTOR
TO BECOME LESS THAN -1 OR GREATER THAN +1, THE TREE MUST BE REBALANCED USING ROTATIONS.
TYPES OF AVL ROTATION
• INSERTIONS: 10 → 20 → 30
• BEFORE:
• INSERTING 30 INTO THE RIGHT OF 20 MAKES 10 UNBALANCED.