min-heap property (original) (raw)

NIST

(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

Go to theDictionary 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 Wed Oct 30 12:15:30 2024.

Cite this as:
Paul E. Black, "min-heap property", inDictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/minheapprop.html