Question

Given a b-tree of degree 5 and a height of 3. What is the maximum number of nodes (including the root) ?

Answer 1

Answer:

A B-tree of degree 5 and a height of 3 consist 31 nodes

Explanation:

Given,

• B-tree of degree = 5

• height = 3

If the degree of B-tree is 5 then it contains 4 nodes in root and the child node contain 5 nodes.

And each child node has 5 node in it.

At level-1, there are only one root node.

At level-2, there is 5 child nodes.

At level-3, there will be 5×5 nodes.

then,

the B-tree consist 1 + 5 + 25

                                      = 31 nodes