# Step By Step Directions From A Binary Tree Node: Interview Notes

Step By Step Directions From A Binary Tree Node is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Find root-to-start and root-to-dest paths as L/R strings, strip the common prefix, replace the start remainder with U's.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n).

## Common mistake

Building paths with string concatenation in recursion can be quadratic; use a list and backtrack.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.