AVL Tree
An AVL tree is a binary search tree that rotates after an insert or delete so the two child heights differ by at most one.
Costs
| Category | Data Structure |
| Difficulty | Hard |
| Search | O(log n) |
| Insert | O(log n) |
| Delete | O(log n) |
Questions
What is AVL Tree?
An AVL tree is a binary search tree that rotates after an insert or delete so the two child heights differ by at most one.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.