Question 79
The vertices of an $n$-vertex tree are labeled by numbers $1$, $2$, $\ldots$, $n$. At each stage one can choose an edge that has not been selected before, and switch the labels of its two ends, until all of the edges have been selected. Show that the final permutation of the labels is a complete cycle of $n$ letters.