Edge of Tree is Bridge

Theorem
Let $T$ be a tree.

Then any vertex $v$ of $T$ is a bridge.

Proof
From Condition for Edge to be Bridge, $v$ is a bridge iff $v$ does not lie on any circuit.

Since $T$ is a tree, there are no circuits in $T$.

The result follows.