Hi all,


Here:-http://www.semaphorecorp.com/btp/algo.html

it is said that

Every B-tree is of some "order n", meaning nodes contain from n to 2n
keys


Does this means that leaf nodes contain 2n values ? AFAIK
the leaf node can contain atmost n-1 values for a B-tree of order n


here:- http://sky.fit.qut.edu.au/~maire/bao...ure/sld009.htm

it is said that if the leaf contains more than minimum no: of
entriesthen one can be deleted with no further action

so what is the lower limit and upper limit for the no: of entries in
the leaf node of a B-tree of order m?

is it floor(m/2) and (m-1) ????

what is the minimum no: of value required in each non leaf node of a
B-tree is it one less than the no: of childrens ??

<aarklon@gmail.com> wrote in message
news:9ffeeb39-753b-4fbe-947c-afd240f60995@h1g2000prh.googlegroups.com...

all of this is more the theory of it all, where in practice, B-Trees are far
less formally defined.
in practice, usually the nodes are usually a fixed size, rather than a fixed
number of keys (albeit, in some cases these may be equivalent).

usually, however much is put in a node, is however much will fit;
however little is how much data we have available that will fit in this
node.

nodes are split if the contents don't fit;
nodes are merged if the contents can merge.