AVL tree information

AVL tree
AVL tree
Type	Tree
Invented	1962
Invented by	Georgy Adelson-Velsky and Evgenii Landis
Complexities in big O notation
Space
Space complexity
Space
Time complexity
Function
Search
Insert
Delete

In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take $O(log n)$ time in both the average and worst cases, where $n$ is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.

The AVL tree is named after its two Soviet inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their 1962 paper "An algorithm for the organization of information".^[2] It is the oldest self-balancing binary search tree data structure to be invented.^[3]

AVL trees are often compared with red–black trees because both support the same set of operations and take ${\text{O}}(\log n)$ time for the basic operations. For lookup-intensive applications, AVL trees are faster than red–black trees because they are more strictly balanced.^[4] Similar to red–black trees, AVL trees are height-balanced. Both are, in general, neither weight-balanced nor $\mu$ -balanced for any $\mu \leq {\tfrac {1}{2}}$ ;^[5] that is, sibling nodes can have hugely differing numbers of descendants.

^ ^a ^b ^c ^d ^e ^f Eric Alexander. "AVL Trees". Archived from the original on July 31, 2019.
^ Adelson-Velsky, Georgy; Landis, Evgenii (1962). "An algorithm for the organization of information". Proceedings of the USSR Academy of Sciences (in Russian). 146: 263–266. English translation by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.
^ Sedgewick, Robert (1983). "Balanced Trees". Algorithms. Addison-Wesley. p. 199. ISBN 0-201-06672-6.
^ Pfaff, Ben (June 2004). "Performance Analysis of BSTs in System Software" (PDF). Stanford University.
^ AVL trees are not weight-balanced? (meaning: AVL trees are not μ-balanced?)
Thereby: A Binary Tree is called $\mu$ -balanced, with $0\leq \mu \leq {\tfrac {1}{2}}$ , if for every node $N$ , the inequality
${\tfrac {1}{2}}-\mu \leq {\tfrac {|N_{l}|}{|N|+1}}\leq {\tfrac {1}{2}}+\mu$
holds and $\mu$ is minimal with this property. $|N|$ is the number of nodes below the tree with $N$ as root (including the root) and $N_{l}$ is the left child node of $N$ .

[wiscurl-1] ^ ^a ^b ^c ^d ^e ^f Eric Alexander. "AVL Trees". Archived from the original on July 31, 2019.

[2] Adelson-Velsky, Georgy; Landis, Evgenii (1962). "An algorithm for the organization of information". Proceedings of the USSR Academy of Sciences (in Russian). 146: 263–266. English translation by Myron J. Ricci in Soviet Mathematics - Doklady, 3:1259–1263, 1962.

[3] Sedgewick, Robert (1983). "Balanced Trees". Algorithms. Addison-Wesley. p. 199. ISBN 0-201-06672-6.

[Pfaff1-4] Pfaff, Ben (June 2004). "Performance Analysis of BSTs in System Software" (PDF). Stanford University.

[5] AVL trees are not weight-balanced? (meaning: AVL trees are not μ-balanced?)
Thereby: A Binary Tree is called $\mu$ -balanced, with $0\leq \mu \leq {\tfrac {1}{2}}$ , if for every node $N$ , the inequality
${\tfrac {1}{2}}-\mu \leq {\tfrac {|N_{l}|}{|N|+1}}\leq {\tfrac {1}{2}}+\mu$
holds and $\mu$ is minimal with this property. $|N|$ is the number of nodes below the tree with $N$ as root (including the root) and $N_{l}$ is the left child node of $N$ .

AVL tree information

and 22 Related for: AVL tree information

AVL tree

Binary search tree

WAVL tree

AVL

Tree rotation

Tree structure

Binary tree

Fibonacci sequence

Order statistic tree

List of data structures

Scapegoat tree

Associative array

Splay tree

Finger tree

Interval tree

AA tree

Judy array

List of Russian scientists

List of graph theory topics

Evgenii Landis

Right rotation

List of Russian mathematicians