(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Chris L. Kuszmaul, "search tree property", 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/searchtrprop.html
