# Graph Valid Tree: Walkthrough

Graph Valid Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A graph is a tree iff it has n-1 edges and is fully connected (or equivalently has no cycle and is connected).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval 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

Checking only 'no cycle' and missing a disconnected extra component.

## 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 try it free.