• A specialized tree-based data structure which is essentially an almost complete binary tree that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C. The node at the “top” of the heap (with no parents) is called the root node. ← Wikipedia

1. Related terms: Root node · KEY · Surrogate key · Tree
2. Previous term: Health check
3. Next term: HECVAT
4. Random term: Focus (webglossary.info/random 🎲)