Heaps

A heap is a special case of a binary tree, in which the top node is compared with its child nodes and their values ​​and arranged accordingly.
An example of minimum heap attribute is 

• Minimum heap: The father's key is less than or equal to his child's key. The root will contain the minimum value of the heap. 
• Maximum heap: The key of the parent item is greater than or equal to the key of its child. This is called the maximum heap attribute. The root will contain the maximum value of the heap.

It is used to implement priority queues, because priority values ​​can be sorted according to heap attributes, and arrays can be used to implement heaps.