AVL trees

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

Meanings

noun
  1. pluralplural of AVL tree
Cite this entry
APA

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

MLA

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

Chicago

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

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