Prove by induction that the maximum number of nodes in a binary tree of height h is 2h+1 -1.
Okay here is my question.
I have started by saying that for:
P(1) = 3
P(2) = 7
P(3) = 15
...
P(n) = 2^n+1 - 1

Then I should Prove it to be true for P(n+1).  But I am stuck there. I dont know how to continue and how to do it. Could someone please guide me
Prove by induction that the maximum number of nodes in a binary tree of height h is 2h+1 -1.
===

Okay here is my question.
I have started by saying that for:
P(1) = 3
P(2) = 7
P(3) = 15
...
P(n) = 2^n+1 - 1

Then I should Prove it to be true for P(n+1).  But I am stuck there. I dont know how to continue and how to do it. Could someone please guide me