- AVL tree controls the height of the binary search tree by not letting it be skewed.
- The time taken for all operations in a binary search tree of height h is O(h).
- However, it can be extended to O(n) if the BST becomes skewed (i.e. worst case).
- By limiting this height to log n, AVL tree imposes an upper bound on each operation to be O(log n) where n is the number of nodes.
Read More →