AVL tree

Summary

AVL tree is an algorithm^[1]. It ranks in the top 4% of algorithm entities by monthly Wikipedia readership (746 views/month).^[2]

Key Facts

• AVL tree is credited with the discovery of Georgy Adelson-Velsky^[3].
• AVL tree is credited with the discovery of Evgenii Landis^[4].
• AVL tree's image is recorded as AVLtreef.svg^[5].
• AVL tree's instance of is recorded as algorithm^[6].
• Georgy Adelson-Velsky is named after AVL tree^[7].
• Evgenii Landis is named after AVL tree^[8].
• AVL tree's subclass of is recorded as height-balanced binary search tree^[9].
• AVL tree's subclass of is recorded as self-balancing binary search tree^[10].
• AVL tree's Commons category is recorded as AVL-trees^[11].
• AVL tree's time of discovery or invention is recorded as +1962-00-00T00:00:00Z^[12].
• AVL tree's Freebase ID is recorded as /m/0wyp^[13].
• AVL tree's Stack Exchange tag is recorded as https://stackoverflow.com/tags/avl-tree^[14].
• AVL tree's native label is recorded as {'lang': 'en', 'text': 'AVL tree'}^[15].
• AVL tree's different from is recorded as red–black tree^[16].
• AVL tree's worst-case time complexity is recorded as O(\log n) (insertion)^[17].
• AVL tree's worst-case time complexity is recorded as O(\log n) (suppression)^[18].
• AVL tree's worst-case time complexity is recorded as O(\log n) (recherche)^[19].
• AVL tree's average time complexity is recorded as O(\log n)^[20].
• AVL tree's average time complexity is recorded as O(\log n)^[21].
• AVL tree's average time complexity is recorded as O(\log n)^[22].
• AVL tree's worst-case space complexity is recorded as O(n)^[23].
• AVL tree's average space complexity is recorded as O(n)^[24].
• AVL tree's Rosetta Code page ID is recorded as AVL_tree^[25].
• AVL tree's Dictionary of Algorithms and Data Structures ID is recorded as avltree^[26].
• AVL tree's Microsoft Academic ID is recorded as 109771385^[27].

Body

Designation and Status

AVL tree's instance of is recorded as algorithm^[6].

History and Context

Things named after include Georgy Adelson-Velsky^[7], a mathematician^[28], 1922–2014^[29], of Soviet Union^[30], specialised in mathematics^[31] and Evgenii Landis^[8], a mathematician^[32], 1921–1997^[33], of Soviet Union^[34], awarded the Order of the Red Star^[35], specialised in differential calculus^[36].

Why It Matters

AVL tree ranks in the top 4% of algorithm entities by monthly Wikipedia readership (746 views/month).^[2] It has Wikipedia articles in 23 language editions, a strong signal of global cultural recognition.^[37] It is known by 31 alternative names across languages and contexts.^[38]