(data structure)
Definition: A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced.
Generalization (I am a kind of ...)
balanced tree.
See also BB(α) tree, balanced binary tree height-balanced binary search tree.
Note: After [HS83, page 442].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 December 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "height-balanced tree", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/heightBalancedTree.html