AVL tree
one kind of self-balancing binary search tree
Facts
11 properties- Instance of
- algorithm
- Subclass of
- height-balanced binary search tree, self-balancing binary search tree
- Average space complexity
- O(n)
- Average time complexity
- O(\log n)
- Different from
- red–black tree[10]
- Discoverer or inventor
- Georgy Adelson-Velsky, Evgenii Landis[4][5]
- Named after
- Georgy Adelson-Velsky, Evgenii Landis[6][7]
- Native label
- AVL tree[9]
- Time of discovery or invention
- 1962[8]
- Worst-case space complexity
- O(n)
- Worst-case time complexity
- O(\log n) (insertion), O(\log n) (suppression), O(\log n) (recherche)
🏷️ Also known as
en AVL trees
en AVL-tree
en AVL tree
en AVL-trees
ar شجرة AVL
cs Avl-strom
cs AVL strom
cs AVL-strom
da AVL-træ
de Doppelrotation
de AVL-Baum
el δένδρο AVL
el AVL δένδρο
el AVL δέντρο
el δέντρο AVL
es Árbol AVL
es arbol AVL
es arboles AVL
es árboles AVL
fa Avl tree
🔖 Identifiers · 6
🔗 Connections
Discoverer or inventor 2
Named after 2
Created notable works 1
Different from 1
Instance of 1
Subclass of 1
Subtypes 1
← Different from 1
Press Enter · cited answer in seconds