# Thin Heap Rank Relation: Walkthrough
Thin Heap Rank Relation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Allow a node to have at most one thin child (rank equal to the parent rank minus two) and repair violations immediately so decrease-key stays logarithmic without cascading marks.
## 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
Worst-case O(log n) decrease-key and delete-min.
## Common mistake
Leaving two thin children on the same node, which breaks the rank-to-size relationship used in the proof.
## 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 https://linkjob.ai.