Thinking About AVL
Observations
- Worst case height of an AVL tree is about 1.44 log n
- All operations supported in worst case O(log n)
- Only one (single or double) rotation needed on insertion
- O(log n) rotations needed on deletion
- Height fields must be maintained (or 2-bit balance)
-
- Coding complexity