Trees

• Why Does a Tree with n Vertices Have n − 1 Edges?
  Prove that every finite tree with n vertices has n − 1 edges by induction, using the fact that each nontrivial tree has a leaf.