AVL tree

== English == === Etymology === Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure. === Noun === AVL tree (plural AVL trees) (computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one. === Anagrams === Elverta, e-travel