NIST

height-balanced binary search tree

(data structure)

Definition: A height-balanced tree which is also a binary search tree. It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree.

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

Specialization (... is a kind of me.)
AVL tree, red-black tree.

Author: PEB


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

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

Entry modified 27 April 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "height-balanced binary search tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 27 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/heightBalancedBinSrchTree.html