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

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

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

in C and CPP 

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

Leave a Reply