# Binary Tree Cameras: Practice Notes
Binary Tree Cameras shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Greedy DFS states: a node is covered, needs a camera, or has a camera. Place a camera when a child needs one; if the root still needs one, place there too.
## 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
Putting a camera on every node, or only on leaves, both of which over/under cover.
## 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 AI help for online coding assessments.