267 views

1 Answer

Best answer
1 votes
1 votes
we need to add all the nodes at every level  (Assuming Level starts from 1 )

Every nodes will have 4 block pointer (Max)  So at level 6 we will have (4*4*4*4*4 ) + for level 5(4*4*4*4) + for level 4(4*4*4) + for level 3(4*4) + for level 2(4) + for level 1(1)
selected by

Related questions

0 votes
0 votes
1 answer
1
pranjalgennext asked Jan 13, 2017
318 views
Assume a B-plus tree as:Size of search key=15BSize of block=512BSize of record pointer=9BSize of block pointer=8BWhat is the maximum number of nodes that can be accomodat...
0 votes
0 votes
2 answers
2
pranjalgennext asked Dec 27, 2016
1,184 views
What is the maximum number of records that can be indexed for a B+ tree of 4 levels with order 10 and root at level 1?
0 votes
0 votes
1 answer
3
0 votes
0 votes
3 answers
4
Na462 asked Feb 2, 2019
2,091 views