Question

what is the minimum possible depth of a d-ary tree ? In d-ary tree, each node has at most d children​

Answer 1

The minimum possible depth should be

$\frac{log(n \: (d \: - \: 1) \: + \: 1)}{log(d)}$

Where, n is the number of nodes in a d-ary tree.