AVL tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

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

Noun[edit]

AVL tree (plural AVL trees)

English Wikipedia has an article on:
Wikipedia
  1. (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[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=AVL_tree&oldid=69002608"