What does the AVL stand for in AVL tree?

Question

An AVL tree is the same as a self-balancing binary search tree. What does AVL stand for? Does it have to do with the name of the inventor?

I downvoted this question because it shows absolutely no initiative on the OP's part to answer his own question. Typing the question into any search engine reveals the answer in a matter of seconds. — Jim Mischel, Jun 20 '16 at 13:27

score 14 · Accepted Answer · answered Jun 17 '16 at 10:14

14

It is the name of the inventors like you guessed. From wiki:

AVL tree is named after its two Soviet inventors, Georgy Adelson-Velsky and Evgenii Landis

Their names spell the acronym, AVL.

answered Jun 17 '16 at 10:14

Idos

15,053
14
60
75

score 1 · Answer 2 · answered Jun 17 '16 at 10:14

An AVL tree is another balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees to be proposed. Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time. Addition and deletion operations also take O(logn) time.

Reference https://www.cs.auckland.ac.nz/software/AlgAnim/AVL.html

What does the AVL stand for in AVL tree?

2 Answers2