| Version 2 |
Version 1 |
| An AVL tree is A balanced binary search tree where the height of the two |
An AVL tree is A balanced binary search tree where the height of the two |
| subtrees (children) of a node differs by at most one. Look-up, insertion, and |
subtrees (children) of a node differs by at most one. Look-up, insertion, and |
| deletion are $O( \ln{n})$, where $n$ is the number of nodes in the tree. |
deletion are $O( \ln{n})$, where $n$ is the number of nodes in the tree. |
| The structure is named for the inventors, Adelson-Velskii and Landis (1962). |
The structure is named for the inventors, Adelson-Velskii and Landis (1962). |
|
\end{document} |
