Is there any algorithm to calculate maximum number of node splits that can occur in given number of insertions and highest branching order? Lets say I want to insert 10 elements to an empty B-tree with highest branching order of 3. Is there way to calculate the maximum number of splits that will occur?

  • $\begingroup$ I believe points for possible algorithm can be as explained in this question. I want to know if closed formula is possible. $\endgroup$
    – RajS
    Jan 28, 2019 at 21:03


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.