Is there a formula to calculate the minimum height of an n-nary tree with L leaves? I'm trying to figure out if there is a way to calculate the minimum height of an n-nary tree with L leaves. Is there such a formula?

I found it:

$$ \text{minimum height}= \lceil \log_n L \rceil$$