Had this question today in my final but dont know how to complete, any suggestions would be appreciated.
Using induction proof to show that every tree has one more node than it has edges.
That is, to prove the statement:
IfT is a tree, and T has n nodes and e edges, then
n = e + 1.