Priority queues and heap-based algorithms — min heaps, max heaps, and heapify.
How heaps maintain the smallest (or largest) element at the top — priority queues, heapify, and heap sort.