Word.ws English Dictionary

AVL tree

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.

avl tree: a self-balancing binary search tree, where, for each node, the heights of the two child subtrees...
Image: Nomen4Omen, CC BY-SA 4.0, via Wikimedia Commons

Noun

AVL tree (plural AVL trees)

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

Forms of AVL tree

pluralAVL trees

Origin of AVL tree

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

Questions about AVL tree

What does AVL tree mean?
AVL tree means a self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.
What part of speech is AVL tree?
AVL tree is a noun.
What is the plural of AVL tree?
The plural of AVL tree is AVL trees.

Words near AVL tree in the dictionary

  1. avized
  2. avizefull
  3. avizes
  4. avizing
  5. AVL
  6. AVL tree
  7. AVL trees
  8. Avlabari
  9. AVLB
  10. AVLBs
  11. AVM

Source and license

Adapted from Wiktionary: AVL tree (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “AVL tree.” Word.ws, https://word.ws/avl_tree. Based on Wiktionary, CC BY-SA 4.0.