# Find Bottom Left Tree Value: Interview Notes

Find Bottom Left Tree Value shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS left-to-right; the first node of the last level (or the last node in a right-to-left BFS) is the answer.

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

Returning the leftmost leaf of the left spine, which may sit above a deeper left leaf on the right.

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