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
possi
Whats the formula used here? Can someone explain please.
On Mon, Nov 19, 2012 at 12:25 PM, Sambhavna Singh
wrote:
> n here denotes the degree of the btree
>
>
> On Mon, Nov 19, 2012 at 12:25 PM, Sambhavna Singh > wrote:
>
>> maximum number of keys in root of btree with n=3 is 2.
>>
>>
>> On Sun,
n here denotes the degree of the btree
On Mon, Nov 19, 2012 at 12:25 PM, Sambhavna Singh
wrote:
> maximum number of keys in root of btree with n=3 is 2.
>
>
> On Sun, Nov 18, 2012 at 6:54 PM, ankita wrote:
>
>> maximum number of keys can B Tree have if degree =3?
>>
>> --
>>
>>
>>
>
>
--
maximum number of keys in root of btree with n=3 is 2.
On Sun, Nov 18, 2012 at 6:54 PM, ankita wrote:
> maximum number of keys can B Tree have if degree =3?
>
> --
>
>
>
--
maximum number of keys can B Tree have if degree =3?
--
