Binary heap

A binary heap is a type of binary tree that satisfies the heap property, where each node is either greater than or equal to its children (max-heap) or less than or equal to its children (min-heap). It is commonly used in priority queues, where the highest (or lowest) priority element is always at the root. Binary heaps are also efficient for implementing heap sort algorithms.