# Cousins In Binary Tree: Practice Notes
Cousins In Binary Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.
## Key idea
BFS level by level, recording each target's parent; cousins share a level but not a parent.
## 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
Returning true for siblings.
## 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 AI help for online coding assessments.