Adding any edge creates exactly one cycle.

Removing any edge disconnects the graph.

It contains at least two leaves (if $n \geq 2$).

All of the above.