# Min Max Heap Grandchild: Explained
Min Max Heap Grandchild shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Alternate min and max levels so a node is smaller (resp. larger) than all descendants on even (resp. odd) levels, and bubble via grandchildren.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log n) insert and extract of either extremum.
## Common mistake
Comparing a new key only with its children and not the grandchildren on the same type of level, which breaks the min- or max-level invariant.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at here.