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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 27 April 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "height-balanced binary search tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 27 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/heightBalancedBinSrchTree.html