A B-tree is an M-way search tree with two special properties:
It is perfectly balanced: every leaf node is at the same depth.
Every node, except perhaps the root, is at least half-full, i.e. contains M/2 or more values (of course, it cannot contain more than M-1 values). The root may have any number of values (1 to M-1).
It is perfectly balanced: every leaf node is at the same depth.
Every node, except perhaps the root, is at least half-full, i.e. contains M/2 or more values (of course, it cannot contain more than M-1 values). The root may have any number of values (1 to M-1).
Post A Comment:
0 comments: