A specialized tree-based data structure that satisfies the heap property, in which the key (the value) at each node is greater than or equal to the keys in the children of that node for a max heap, or less than or equal to for a min heap.

"Heaps are used in algorithms like heap sort and to implement priority queues, where the highest (or lowest) priority element needs to be removed first."