# KPGCET-CSE-2019-69

24 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

## Related questions

1
47 views
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these