The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by :
- $K^{h}$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$
- $K * h$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
- $K^{h}$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
- $K * h$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$