# Find All The Lonely Nodes: Explained

Find All The Lonely Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

In a binary tree, a lonely node is one whose parent has exactly one child. DFS/BFS and, whenever a node has only a left or only a right child, record that child.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Recording the parent instead of the child, or treating a leaf as lonely (a leaf's parent may still have two children).

## 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 tool for job interviews.