# Minimum Distance Between BST Nodes: Walkthrough

Minimum Distance Between BST Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Inorder is sorted, so the minimum difference is the min gap between consecutive inorder values (track prev).

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

Comparing only a node to its two children and missing a closer pair across a subtree boundary.

## 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 https://linkjob.ai.