# Symmetric Tree: Study Guide
Symmetric Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A tree is symmetric iff the left and right subtrees are mirrors: compare a.left with b.right and a.right with b.left recursively (or BFS two pointers).
## 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
Checking only that the root's two children are equal and ignoring deeper structure.
## 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 interview copilot app.