# Add One Row To Tree: Practice Notes
Add One Row To Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
BFS to depth-1, then insert new nodes with the old left/right children attached on the same sides.
## Steps to say out loud
1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.
## Complexity
O(n).
## Common mistake
Depth 1 is a special case: the new node becomes the root.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at linkjob.ai.