Let G be a graph in which every vertex has degree 2.

Is G necessarily a cycle?
I suspect not but I'm having hard time showing this.

Also,
Let be a tree. Prove that the average degree of a vertex in T is less than 2.
I know that the sum of degrees of all vertices is $2|E|=2|V|-2$. Thus the graph must be connected, and the average degrees of a vertex is less than 2, so the vertices must be a degree of one. Is this correct?

If $G$ is connected and every vertex has degree $2$ then $G$ is a cycle.
If $G$ is finite, then it must contain a cycle. Start at any vertex, and follow the edges. Eventually you'll run out of new vertices, and have to visit one you've been to before. But they all have degree 2, so it must be the starting vertex.