> >Therefore, what >> type of proof is expected below? > >A convincing proof :) > >> Question 3.1 asks us to "prove that a binary tree with N nodes > > has N+1 null pointers."
There is a name for the technique Hans used: it is called proof by induction. There should be a discussion in you Discrete Math textbook, and you should be able to find some examples on the web as well. When asked to prove one thing, Hans used proof by induction. If Hans proved the last result using proof by induction, then his next proof will also use proof by induction. Therefore Hans will always prove his results by induction. - jeff parker
