AVL tree

Summary

AVL tree is an algorithm^[1]. It ranks in the top 4% of algorithm entities by monthly Wikipedia readership (1,909 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 instance of is recorded as algorithm^[5].
• Georgy Adelson-Velsky is named after AVL tree^[6].
• Evgenii Landis is named after AVL tree^[7].
• AVL tree is a type of height-balanced binary search tree^[8].
• AVL tree is a type of self-balancing binary search tree^[9].
• AVL tree's Commons category is recorded as AVL-trees^[10].
• AVL tree's time of discovery or invention is recorded as 1962^[11].
• AVL tree's Stack Exchange tag is recorded as https://stackoverflow.com/tags/avl-tree^[12].
• AVL tree's native label is recorded as AVL tree^[13].
• AVL tree's different from is recorded as red–black tree^[14].

Body

Designation and Status

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

History and Context

Things named after include Georgy Adelson-Velsky^[6], a mathematician^[15], 1922–2014^[16], of Soviet Union^[17], specialised in mathematics^[18] and Evgenii Landis^[7], a mathematician^[19], 1921–1997^[20], of Soviet Union^[21], awarded the Order of the Red Star^[22], specialised in differential calculus^[23].

Why It Matters

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