Question

Maximum number of nodes in a binary tree with height k, where root is height 0, is

Answer 1

The maximum number of nodes in a binary tree of depth is 2 k − 1 , k ≥ 1 . The maximum number of nodes in a binary tree of depth is 2 k − 1 , k ≥ 1 .

Answer 2

The maximum number of nodes in a binary tree with height k, where the root height 0 is, 2k+1 − 1.

2h-1 is the maximum number of nodes in a binary tree of height h. The maximum number of nodes on the root-to-leaf path is given by height. The height of a tree with one node is 1 in this case. The number of leaf nodes in a binary tree with 0 or 2 children is always one more than the number of leaf nodes in a binary tree with two children.