Question

The number of leaf nodes in a complete binary tree of depth d is

Answer 1

2 ^d -1 is the formula to calculate depth

Answer 2

Answer:

The binary tree which has height K contains ( $2^{k} -1$)  nodes

Explanation:

The binary tree is a tree whose node have two children.each children is designated as either a left child or a right child.

all non terminal nodes have both their children and all leaves in same level

There are utmost $2^{i}$ nodes at level i+1

The binary tree which has height K contains ( $2^{k} -1$)  nodes

#SPJ3