Identifying a Tree by Edge Count

A connected undirected graph contains n vertices and exactly n-1 edges. What structure must it be?

Quant interview-style problem · QS-XNA025

Your answer

Think first. Use hints deliberately. Study the reasoning only when you need it.