Lazy Heap Deletion: When to Use It

Start with the idea

A problem is a good match for Lazy Heap Deletion when it asks for sliding heaps and priority updates without handles. Here the concrete task is: Apply the push/delete operations, then return the valid minimum requested by min. The visible input push4 push7 push2 delete2 min is an example, not a definition of the whole problem. Ask what operations the solution must support and what the input guarantees. Use it when only top-ranked candidates or repeated next-best extraction matters; sorting the entire stream may waste work. The right choice follows from those guarantees, not from a familiar noun in the prompt.

The decisive invariant is: Record invalidated values separately and discard stale roots only when they surface. Try to say why it applies to the task without quoting the implementation. Which fact becomes known after one update, and which possible answers remain? A heap keeps the current extremum accessible while new items arrive. Explain what belongs in the heap and what may be discarded. If that claim cannot be maintained on a legal input, the pattern is wrong or one of its preconditions is missing. A counterexample is more useful than a vague warning: change one property of the sample, trace the first two steps, and identify the exact claim that fails.

Compare costs before committing. The advertised bound is O(log n) amortised operation · O(n) space; identify the operation responsible for it and the extra memory it needs.