(definition)
Definition: Each node in a tree has a key which is greater than or equal to the key of its parent.
See also max-heap property, heap property.
Note: After LK.
Author: PEB
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:05 2006.
Cite this as:
Paul E. Black, "min-heap 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/minheapprop.html
