AVL tree (height-balanced tree) A binary search tree such that for each node the heights of the left and right subtrees differ by at most one. Thus the balance of each node is –1, 0, or +1. During insertion or deletion, a node in an AVL tree may become critical or unbalanced and then the tree has to be reorganized to maintain its balanced property. The tree is named for its originators, Adel'son-Vel'skii and Landis.
More From encyclopedia.com
Ipoh , Ipoh •capo • Gestapo •Aleppo, depot •downtempo, tempo, uptempo •Expo •cheapo, Ipoh, peep-bo, repo •hippo •hypo, typo •oppo, topo, troppo •compo • Lim… Bo Tree , Bo tree (Bodhi tree) In Buddhism, the pipal under which the Buddha (Siddhartha Gautama) found enlightenment (bodhi) at Bodh Gaya, near Varanasi, n In… Upas Tree , upas tree in folklore, a Javanese tree alleged to poison its surroundings and said to be fatal to approach. An account of the tree was given in the L… tree fern , tree fern Tree-like fern of the family Cyatheaceae. Tree ferns grow in tropical and sub-tropical regions, particularly moist mountainous areas. Heigh… Tree Shrews , Tree shrews tree shrew, small, arboreal mammal of the family Tupaiidae, found in S Asia. The 17 known species of tree shrews are classified as the or… Para Rubber Tree , rubber tree Any of several South American trees whose exudations can be made into rubber; especially Hevea brasiliensis (family Euphorbiaceae), a tal…
About this article
Updated About encyclopedia.com content Print Article
You Might Also Like