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.
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:34 2011.
Cite this as:
Paul E. Black, "max-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/maxheapprop.html