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 deletion are , where is the number of nodes in the tree.
The structure is named for the inventors, Adelson-Velskii and Landis (1962).
|Date of creation||2013-03-22 13:24:39|
|Last modified on||2013-03-22 13:24:39|
|Last modified by||PrimeFan (13766)|