Count the number of trees with vertex set [n] {1, 2, ..., n} and the following property
a. trees have exactly 2 leaves,
b. trees have exactly n - 2 leaves. (You can use the Prufer correspondence or direct counting argument. However, I recommend to do both and make sure you get the same answer.)