# Add One Row To Tree: Interview Notes

Add One Row To Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS/DFS to depth depth-1 and insert new nodes as the old children's parents.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree 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

Inserting at depth instead of as children of depth-1 (off-by-one).

## 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 Linkjob AI interview assistant.