Heaps and Priority Queues

O(1) because the minimum is always at the root O(log n) because after removing the root, the heap must be re-heapified by sifting down O(n) because all elements must be checked O(n log n) because the entire heap must be rebuilt