# Populating Next Right Pointers: Interview Notes

Populating Next Right Pointers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS: the next pointer of node i in a level is node i+1 (or null at the end). For perfect trees you can also wire children via the parent's next without a queue.

## 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) extra O(1) on perfect trees.

## Common mistake

Only linking siblings that share a parent and leaving gaps between adjacent parents.

## 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 undetectable AI interview copilot.