We know that trees with at least two vertices have at least two leaves. But typically trees have more leaves than that.
(a) Show that if a tree has a vertex of degree k, then it has at least k leaves.
(b) Let T be a tree with n vertices, k leaves, and a vertex with degree k, where k>=2. Suppose that n>k+1. Prove that T has a vertex of degree two.