Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01397574n
Noun Concept
Categories: 1962 in computer science, Search trees, Soviet inventions, Amortized data structures, date and year
EN
AVL tree  Adelson-Velskii Landis tree  AVL-tree  AVL-trees  AVL trees
EN
In computer science, an AVL tree is a self-balancing binary search tree. Wikipedia
Definitions
Relations
Sources
EN
In computer science, an AVL tree is a self-balancing binary search tree. Wikipedia
A data structure named after inventors Adelson-Velsky and Landis that is used in computer programming Wikipedia Disambiguation
One kind of self-balancing binary search tree Wikidata
A self-balancing binary search tree, where for each node, the heights of the two child subtrees differ only by at most one. Wiktionary
IS A
algorithm
self-balancing binary search tree
HAS KIND
Fibonacci tree
DIFFERENT FROM
red–black tree
DISCOVERER OR INVENTOR
Georgy Adelson-Velsky
Evgenii Landis
NAMED AFTER
Georgy Adelson-Velsky
Evgenii Landis
Wikipedia
EN
AVL tree
Wikidata
EN
AVL tree
Wiktionary
EN
AVL tree
Wikipedia Redirections
EN
Adelson-Velskii Landis tree, AVL-tree, Avl Tree, Avl tree, AVL Tree, AVL trees
Wikidata Alias
EN
AVL-tree, AVL-trees, AVL trees

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License