AVL Trees
Self-balancing binary search tree with automatic rotations to maintain height balance
Time Complexity
| Operation | Average | Worst Case |
|---|---|---|
| Insert | O(log n) | O(log n) |
| Search | O(log n) | O(log n) |
| Delete | O(log n) | O(log n) |
| Build from n nodes | O(n log n) | O(n log n) |
Controls
Red node: Last rotation point
h: Height of subtree
Nodes (0)
No nodes yet. Add some above!