balanced binary search tree

(data structure)

Definition: A binary search tree that is balanced.

Generalization (I am a kind of ...)
balanced binary tree, binary search tree.

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

More information

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.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:00 2006.

Cite this as:
Paul E. Black, "balanced binary search tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/balancedbist.html