** Hans List, Austrian founder of the AVL List ( d. 1996 )

** Folio 79 recto: Mulberry tree

** Folio 79 recto: Nut tree

** Folio 79 verso: Beech tree

** Folio 79 verso: Carob tree

** Folio 79 verso: Pistachio tree

** Folio 79 verso: Fir tree

** Folio 80 recto: Plane tree

** Folio 80 recto: Ash tree

** Folio 80 verso: Box tree

** Systematics: taxon — taxonomy — scientific classification — phylogeny — evolutionary tree — cladistics — synapomorphy — homology — molecular clock

** a direct interaction occurs when one object is on a level exactly one higher or one lower than the other ( i. e., on a tree, the two objects have a line between them )

** and RefactoringNG, a Netbeans module for refactoring where you can write transformations rules of the program's abstract syntax tree.

** Three peasant children claim to see the Virgin Mary above a Holm Oak tree in Cova da Iria near Fátima, Portugal.

** Pedigree chart or family tree

** Rain tree ( Samanea saman )

** binary search tree

** Estonian puu " tree, wood " ( singular ) – puu < u > d </ u > " the trees, woods " ( nominative plural )

** Caesalpinia sappan-East Indian Redwood, or Sapanwood tree ( first called " brezel wood " in Europe )

** Caesalpinia echinata-South American Redwood, or Brazilwood tree

** if that edge connects two different trees, then add it to the forest, combining two trees into a single tree

** remove from the set an edge with minimum weight that connects a vertex in the tree with a vertex not in the tree

** add that edge to the tree

** Calophyllum inophyllum, and evergreen tree in family Calophyllaceae

In computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.

In an AVL tree, the heights of the two child subtrees of any node differ by at most one.

In other words AVL tree is a binary search tree where the height of the left subtree differs from the height of the right subtree by at most 1 level, if it exceeds 1 level then rebalancing occurs.

The AVL tree is named after its two Soviet inventors, G. M. Adelson-Velskii and E. M. Landis, who published it in their 1962 paper " An algorithm for the organization of information.

Basic operations of an AVL tree involve carrying out the same actions as would be carried out on an unbalanced binary search tree, but modifications are preceded or followed by one or more operations called tree rotations, which help to restore the height balance of the subtrees.

Lookup in an AVL tree is performed exactly like in any unbalanced binary search tree.

* AVL tree applet – all the operations

* Self balancing AVL tree with Concat and Split operations

The AVL tree is another structure supporting O ( log n ) search, insertion, and removal.

Tree rotations are used in a number of tree data structures such as AVL trees, red-black trees, splay trees, and treaps.

Pictorial description of how rotations cause rebalancing in an AVL tree.

A type of tree which uses this rebalancing technique is the AVL tree.

* AVL tree, red-black tree, and splay tree, kinds of binary search tree data structures that use rotations to maintain balance.

* AVL tree, a data structure used in computer programming

* AVL tree