Maximum no. of nodes in a B-tree : ∑ from i=0 to h-1 of (n+1)^i = 1/n * ( (n+1)^h -1). This is the case as, each node can have a max. of n keys, then it will have a max. of n+1 children. So then summing up the max. no. of children from the root till the level h-1, gives the total no. of nodes possible in a B-tree.
Since each node has a max. of k-keys then, Max. no. of keys in a B-tree = n * 1/n * ((n+1)^h -1) = *(n+1)^h - 1* On Tue, Nov 20, 2012 at 11:14 AM, Sonu <sonuindi...@gmail.com> wrote: > Whats the formula used here? Can someone explain please. > > > On Mon, Nov 19, 2012 at 12:25 PM, Sambhavna Singh <coolsambha...@gmail.com > > wrote: > >> n here denotes the degree of the btree >> >> >> On Mon, Nov 19, 2012 at 12:25 PM, Sambhavna Singh < >> coolsambha...@gmail.com> wrote: >> >>> maximum number of keys in root of btree with n=3 is 2. >>> >>> >>> On Sun, Nov 18, 2012 at 6:54 PM, ankita <ankitamc...@gmail.com> wrote: >>> >>>> maximum number of keys can B Tree have if degree =3? >>>> >>>> -- >>>> >>>> >>>> >>> >>> >> -- >> >> >> > > -- > > > --
