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 ...)
See also BB(α) tree, balanced binary tree height-balanced binary search tree.
Note: After [HS83, page 442].
[Knuth98, 3:459, Sect. 6.2.3]
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "height-balanced tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 20 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/heightBalancedTree.html