TestBook TestSeries question to find max child possible in B+ Tree

Question

In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys?

A. 17

B. 19

C. 59

D. 57

Comments

index=6 means minimum degree is 3 and minimum key is 2.

in question telling about maximum number of node  then we select minimum degree of the node

level    node     key

1          1           1

2          2            2*2

3          2*3         2*3*2

4          2*3*3     2*3*3*2 we know that all record store at last level here total key is 36

5         2*3*3*3     2*3*3*3*2 here total key is 108 which is more  than the 83 so we can consider at only level 4

so total number of node till 4 level is 27

---

No we have to maximize the nodes .

Ans : 57

---

yes i minimize the degree of the node and maxmize the number of node in B+ tree