# Merge Two Binary Trees: Interview Notes
Merge Two Binary Trees is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
Recurse on both roots; if one is null return the other, otherwise sum values and merge children.
## 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(min(n1,n2)).
## Common mistake
Mutating input trees when the interviewer wanted a new tree; ask first.
## 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 copilot.