# Skew Heap Self Adjusting: Practice Notes

Skew Heap Self Adjusting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Merge two heaps by walking right spines and always swapping left and right children, so no explicit rank field is stored.

## 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

Amortized O(log n) merge via the same potential as a splay-style analysis.

## Common mistake

Skipping the unconditional swap, which turns the structure into an unbalanced leftist heap without the NPL guarantee.

## 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 AI assistant for technical interviews.