7 views

A binary tree of height $h$ can have at most minimum of _______ elements where $n$ is the height of the tree.

1. $2^n$
2. $2^n+1$
3. $2^n+1$
4. $2^{2n}$
in Others
recategorized | 7 views