In computer science, a Heap is a specialized Tree-based Data structure which is essentially [a 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 Heap is one maximally efficient implementation of an Abstract data type called a Priority queue.

## Types

## Bibliography

“Heap (Data Structure).” 2022.

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