so' given a B tree of height $h$ and order $t\ge2$,

i would like to know what is the formula for minimum and maximum total keys in the tree.

I've stumbled upon the maximum formula: $2t^{h+1}-1$

cant find the minimum anywhere.

example:: t=5 , h=3

min:249 max:9999

  • $\begingroup$ Hint: Minimum no of nodes at height h = maximum no of nodes at height (h-1) + 1 $\endgroup$
    – Rinkesh P
    Mar 1 at 12:30


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.