Minimum Number of Nodes for Full Binary Tree with Level $\lambda$ If the level ($\lambda$) of a full binary tree at zero is just a root node, than I know that I can get the maximum possible number of nodes (N) for a full binary tree using the following:
N = $2^{\lambda+1}$- 1
Is the minimum possible number of nodes the following?
N = 2*$\lambda$ + 1

Sorry to say but what all of you are discussing. AFAIK for full binary tree nodes = [(2^(h+1)) - 1] (fixed).


*

*For strict binary tree, max node = [2^h + 1] and min node = [2h + 1].

