AVL tree
English
Etymology
Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.
Noun
- (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
This article is issued from
Wiktionary.
The text is licensed under Creative
Commons - Attribution - Sharealike.
Additional terms may apply for the media files.