Maximum number of nodes in a binary tree with height k, root is at height 0, is:
A. 2k − 1
B. 2k+1 − 1
C. 2k-1 + 1
D. 2k + 1
Answer:B
Maximum number of nodes in a binary tree with height k, root is at height 0, is:
A. 2k − 1 B. 2k+1 − 1 C. 2k-1 + 1 D. 2k + 1