# Sum Root To Leaf Numbers: Study Guide

Sum Root To Leaf Numbers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS carrying the number so far: cur = cur*10 + node.val; at a leaf add cur to 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

Adding the digits without multiplying by 10, which treats 1-2-3 as 6 instead of 123.

## 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 job interview answers in real time.