The Linux Foundation Projects
Skip to main content

Heap

A specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. The node at the ‘top’ of the heap (with no parents) is called the root node.