In computer science, a heap is a specialized tree-based [tree] data structure [data structure] which is essentially an almost complete tree that satisfies the heap property [Heap property]: in a max heap [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 [Min heap], the key of P is less than or equal to the key of C.

The heap is one maximally efficient implementation of an abstract data type called a priority queue [Queue].

## Types

## References

“Heap (Data Structure).” 2022.

*Wikipedia*, May. https://en.wikipedia.org/w/index.php?title=Heap_(data_structure)&oldid=1088468512.