14.5

Consider the modified redistribution scheme for B+-trees described on page 651. What is the expected height of the tree as a function of n?

---

If there are \(K\) search-key values and \(m - 1\) sibilings are involved in the redistribution, the expected height of the tree is: \(\log_{\lfloor (m-1)n/m \rfloor} (K)\)