# Depth of an R-tree, given $m$, $M$ and number of elements

Simply: what is the theoretical maximum, minimum or expected depth of an R-tree given $$m$$ minimum $$M$$ maximum elements in a node, with $$N$$ amount of nodes?