Encyclopedia > AVL tree

  Article Content

AVL tree

An AVL tree is a balanced binary search tree where the height of the two child subtrees differ by at most one, otherwise known as height-balanced[?]. Look-up, insertion and deletion are all O(log(n)) in both the average and worst cases. Additions and deletions may require the tree to be rebalanced by one or more tree rotations. The AVL tree is named after its inventors, Adelson-Velskii[?] and Landis[?] (1962).

See also: B-tree, Red-Black tree



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Grateful Dead

... the USA from the winter of 1965 until July 9, 1995 - with a few detours to Canada and Europe (see Dick's Picks 7, Hundred Year Hall, Steppin' Out with the Grateful ...

 
 
 
This page was created in 51.7 ms