Determine minimum and maximum number of leaves on a complete tree I want to determine the minimum and maximum number of leaves of a complete tree(not necessarily a binary tree) of height $h$.
I already know how to find minimum($h+1$) and maximum($2^{h+1}-1$) number of nodes from the height, but what about leaves? Is there a way to determine them knowing nothing but height of the tree?
Hint:


   Try the case $h=1$.  What's the minimum?  What's the maximum?