# Minimum Absolute Difference In BST: Interview Notes

Minimum Absolute Difference In BST is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Inorder traversal visits values ascending, so the minimum gap is always between consecutive visited values; track prev.

## 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) time, O(h) stack.

## Common mistake

Comparing only parent-child pairs misses gaps across subtrees.

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