# Validate Binary Tree Nodes: Interview Notes

Validate Binary Tree Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Exactly one node should have indegree 0 (the root) and every other node indegree 1; then BFS/DFS from the root must visit all n nodes (no cycle, no extra roots).

## 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

Only checking that left and right children are in range, which allows two parents or a cycle.

## 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 Linkjob AI copilot.