# Smallest String Starting From Leaf: Study Guide

Smallest String Starting From Leaf shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS building the string from node to leaf (or append and reverse at a leaf) and keep the lexicographically smallest complete leaf string.

## 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 * h).

## Common mistake

Comparing partial paths before you reach a leaf, which can pick a prefix that later loses.

## 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 best AI tool for coding tests and OAs.