← Glossary
What does "AVL tree" mean in programming?
AVL tree is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.
Definition
A self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one. Named after inventors Adelson-Velsky and Landis. Guarantees O(log n) operations by rebalancing via rotations after insertions and deletions.
Example
"An AVL tree rebalances itself after each insert to keep height O(log n)."
Related terms
Ready to practice your English at work?
Lingua-e has interactive exercises built around real developer conversations: standups, code reviews, retrospectives, and more. Practice until it comes naturally.
Try Lingua-e for free