Minimum number of levels in an n-ary tree?

Question

I understand intuitively why in a binary tree there are a minimum of floor(log₂(n)) + 1 levels. I was wondering if there is an equivalently straightforward algorithm