AVL tree

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 O(lnn), where n is the number of nodes in the tree.

The structure is named for the inventors, Adelson-Velskii and Landis (1962).

Title AVL tree
Canonical name AVLTree
Date of creation 2013-03-22 13:24:39
Last modified on 2013-03-22 13:24:39
Owner PrimeFan (13766)
Last modified by PrimeFan (13766)
Numerical id 9
Author PrimeFan (13766)
Entry type Definition
Classification msc 05C05