For a Cycle Graph is there only one Spanning tree?

Question

For example a Cycle Graph C200 has only 1 spanning tree right?

Because adding just one edge to a spanning tree will create a cycle?

Answer 1

Technically, $C_n$ will have $n$ spanning trees ($n$ choices for the edge you you delete). But they are all isomorphic (paths of length $n-1$), so it depends on whether you want to consider them as distinct or the same.