# Second Minimum Node In A Binary Tree: Explained

Second Minimum Node In A Binary Tree is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Root is the global min; DFS for the smallest value greater than root, pruning subtrees whose root already exceeds it.

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

Returning root value when no second minimum exists instead of -1.

## 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 AI tool for job interviews.