A heap is a tree data structure constructed from the priority number that needs to satisfy a heap property
The number is called priority because priority queues are often implemented this way
Heaps are favourite data structures for many applications:
A heap can satisfy one of this two property:
In a min heap:
In a max heap,
Example: a binary max heap (By Ermishin - Own work, CC BY-SA 3.0)