minimum and maximum TOTAL keys in a B-tree

Ask Question

Asked 3 months ago

Modified 3 months ago

Viewed 31 times

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

asked Mar 1 at 11:24

WalaWizon

113 bronze badges

$\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

Add a comment |

0 Your Answer

Name

Required, but never shown

Post as a guest

Name

Required, but never shown

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.