Prove that the maximum number of nodes in a binary tree of height “k” is 2^k+1-1.

a) Prove that the maximum number of nodes in a binary tree of height “k” is 2^k+1-1.

Leave a Reply