# Univalued Binary Tree: Study Guide
Univalued Binary Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
DFS comparing every node with the root value, short-circuiting on the first mismatch.
## 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
Comparing only with the parent is equivalent but easy to get wrong with nulls.
## 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 official website.