The minimum Spanning tree problem in which a given vertex is required to have a fixed number of incident edges was solved by F. Glover and D. Klingman. This paper give a simple algorithm finding the second spanning tree with a fixed number of edges at a vertex，and extend this algorithm to finding the second order-constrained base of Matroid.