# Maximum Width Of Binary Tree: Interview Notes
Maximum Width Of Binary Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS while giving each node a heap-style index (left=2*i, right=2*i+1); a level's width is last_index - first_index + 1. Normalize indices per level to avoid overflow.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Counting the nodes present in a level, which ignores gaps and undercounts the width.
## 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 interview assistant.