| Current Forum: 15-211 Main Forum |
| Date: Tue Dec 18 2001 8:25 am |
| Author: White, David <white3@andrew.cmu.edu> |
| Subject: question from midterm... |
|
|
I missed the question with proving by induction
that the number of nodes in a perfect binary
tree with h, = 2^(h+1) -1.
I got that the base case was h=0, N=0, h=1, N=1.
I also got the inductive hypothesis:
assume N(h)=2^(h+1)-1 works.
but I missed the inductive step. Anyone who got it care
to share how to do it?
Thanks |
|