Heap is a specialized tree-based data structure. It is an almost complete tree. In an amax heap, the key (the value) of the parent node is greater than or equal to the key of the child node. In a min heap, the key of the parent node is less than or equal to the key of the child node.