Definitions for "AVL tree"
Related Terms:
Binary search tree, Complete binary tree, Red-black tree, Binary tree, Heap, Trie, Subtree, Spp, Binary heap, Redwood, B*-tree, Arboreous, B-tree, Deciduous forest, Hornbeam, Forest type, Windfall, Blowdown, Steiner tree, Dominant trees, Felling, Serviceberry, Codominant, Arboreal, Internal node, Hemlock, Old-growth forest, Leaf node, Fir, Spruce, Windthrow, Tree structure, Dominant, Juneberry, Root node, Hazel, Arborescent, Guaiacum, Larch, Snag, Temperate forest, Grove, Old growth, Sycamore, Old growth forest, Douglas fir, Ironwood, Tropical rainforest, Crown class
a balanced binary search tree
a balanced tree, but binary tree can be unbalanced also
a binary search tree in which all nodes are balanced
a binary search tree in which the heights of the left and right sub trees of any node differ by at most one
a binary search tree that remains balanced as long as no insertion or removal is done
a binary search tree which has the balance property described above
a binary tree in which the difference between the height of the right and left subtrees (or the root node) is never more than one
a binary tree with the added requirement that the heights of the two subtrees of each node may differ by no more than one We believe our implementation is reasonably robust
a self-balancing binary search tree, as described by Adelson-Velskii and Landis
a self balancing, robust binary search tree
a set of nodes (or elements)
a special type of binary tree that is always "partially" balanced
A type of balanced tree (see balanced tree), where the AVL balance factor (see balance factor) of each node is limited to -1, 0, or +1.
In computer science, an AVL tree is a self-balancing binary search tree, and 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, therefore it is also called height-balanced. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases.