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