Site Navigation
Categories:
Binary trees
Articles with unsourced statements since October 2007
All articles with unsourced statements
Articles with unsourced statements since August 2007

Summary Of: AVL tree

The AVL tree is named after its two inventors... The AVL tree balancing algorithm appears in many computer science curricula... The basic operations of an AVL tree generally involve carrying out the same actions as would be carried out on an unbalanced... Insertion into an AVL tree may be carried out by inserting the given value into the tree as if it... Lookup in an AVL tree is performed exactly as in an unbalanced binary search tree... The AVL tree is more rigidly balanced than Red...

Encyclodia Page On: AVL tree

These Are Links To Other Documents
| citations | footnotes | inline citations | | | | | computer science | self-balancing binary search tree | data structure | heights | child | height-balanced | O | tree rotations | G.M. Adelson-Velsky | E.M. Landis | red-black trees | O | binary search tree | tree rotations | | | tree rotation | splay tree | amortized | citation needed | Trees | Tree rotation | Splay tree | Red-black tree | B-tree | T-tree | List of data structures | Proceedings of the USSR Academy of Sciences | English | Donald Knuth | ISBN 0-201-89685-0 | Robert Sedgewick | ISBN 0-201-06672-6 | Stanford University | Linoleum | Assembler | Category | Binary trees | Articles with unsourced statements since October 2007 | All articles with unsourced statements | Articles with unsourced statements since August 2007 |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "AVL tree".