Priority Queues (Heap)

Always-sorted-by-priority access in O(log n) — the min-heap, max-heap, and heapify.