For Root node
|
min |
max |
B.pointers |
2 |
10 |
Keys |
1 |
9. |
Non root |
min |
max |
B.pointers |
Ceils(10/2)=5 |
10 |
Keys |
4. |
9. |
#of levels |
#of nodes |
#of Block Pointers |
#of keys |
1 |
1 |
10 |
9 |
2 |
10 |
10*10 |
10*9 |
3 |
100 |
100*10 |
100*9 |
In B+ tree max no of pointers at Root node and non root node.
Here mentioned that use maximum no of pointers so max pointer in any root or non root is 10.
B+ tree at leaf level it contain all keys.
so it is 900 keys total at level 3.