# Minimum Number Of Operations To Sort A Binary Tree By Level: Practice Notes

Minimum Number Of Operations To Sort A Binary Tree By Level shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort each level of a binary tree into increasing order using swaps of values among nodes on that level; return the total swaps. For each level, the min swaps to sort is n - cycles in the permutation that takes current values to sorted order (cycle decomposition).

## 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(n log n) from per-level sorts.

## Common mistake

Bubble-counting adjacent swaps instead of cycle swaps, or sorting across different levels.

## 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://www.linkjob.ai/.