NIST

search tree property

(definition)

Definition: When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child.

Note: A binary tree which has this property is a binary search tree.

Author: CLK


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 17 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Chris L. Kuszmaul, "search tree property", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/searchtrprop.html