How to prove that $3$-Spanning-Tree decision problem is $NP$-Complete
Reduce from Hamiltonian path, attach a dummy vertex to each original vertex. After removing dummy vertices, each original vertex would have degree at most $2$ in the (remaining) of the spanning tree. A connected graph every vertex of which has degree at most $2$ is a path or a cycle.