Heap

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: in a min-heap, the value of each node is greater than or equal to the value of its parent; in a max-heap, the value of each node is less than or equal to the value of its parent. Heaps are commonly used for priority queues and heapsort algorithms.