(data structure)
Definition: A binary search tree that is balanced.
Generalization (I am a kind of ...)
balanced binary tree, binary search tree.
Aggregate parent (I am a part of or used in ...)
jelly-fish.
Note:
Usually "balanced" means "height balanced".
Quentin F. Stout and Bette L. Warren, Tree Rebalancing in Optimal Time and Space, CACM, 29(9):902-908, September 1986.
Author: PEB
Example of balancing a BST.
[Knuth98, 3:459, Sect. 6.2.3]
Knuth refers to "balanced trees", but defines them as ordered, for searching, and binary.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 29 August 2014.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "balanced binary search tree", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 29 August 2014. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/balancedbist.html