Definition: A binary tree where the balance of every subtree, ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α.
Also known as weight-balanced tree.
Generalization (I am a kind of ...)
binary tree, balanced tree.
Specialization (... is a kind of me.)
See also height-balanced tree.
Note: After Johann Blieberger <firstname.lastname@example.org>, Discrete Loops and Worst Case Performance, page 22.
See [GBY91, pages 100-102].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 November 2009.
HTML page formatted Fri Feb 23 10:06:07 2018.
Cite this as:
Paul E. Black, "BB(α) tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bbalphatree.html