AVL tree

noun

A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.

Meanings

nounAVL tree (plural AVL trees)

plural AVL trees

  1. computerA self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.

Origin

Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.

Full word history & related roots →
Cite this entry
APA

AVL tree. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/AVL%20tree

MLA

“AVL tree.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/AVL%20tree. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “AVL tree,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/AVL%20tree.

Source: AVL tree on Wiktionary, CC BY-SA 4.0.