# Amount Of Time For Binary Tree To Be Infected: Practice Notes

Amount Of Time For Binary Tree To Be Infected shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Treat the tree as an undirected graph via parent pointers, then BFS from the start node; the last distance reached is the infection time.

## 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 infecting downward children and never spreading to the parent.

## 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 multilingual AI interview assistant.