Pop (Sift-Down)

Remove the min (root): replace with the last element, shrink, then sift down.

At each level, find the smaller of left/right child. If it's smaller than the current, swap and recurse. Bounded by tree height: O(log n).

Symmetric to sift-up, but we go down. Together with push, gives complete priority queue API.