# Merge Two Binary Trees: Walkthrough
Merge Two Binary Trees shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
If either node is null return the other; otherwise add the values and recurse on both left children and both right children.
## 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
Concatenating the trees side by side instead of overlapping them.
## 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 the Linkjob AI app.