R-trees, like B-trees, have a large branching factor that can be customized based on the block size of the disk or memory they're stored in. This branching factor is M, so the height of the tree is proportional to the base-M logarithm of N.
Hope this helps!