Concept: tree-height bound on heap operations
A binary heap is a complete binary tree of height **log n**. Push appends the new value at the bottom and bubbles it up by repeated parent comparisons - at most one swap per level, so **O(log n)** comparisons and swaps.