620 views

1 Answer

Best answer
1 1 vote
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
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
537
537 views
pranjalgennext asked Jan 13, 2017
537 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 0 votes
2 2 answers
1.5k
1.5k views
pranjalgennext asked Dec 27, 2016
1,514 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 0 votes
1 1 answer
1.1k
1.1k views
gateexplore asked Jun 30, 2023
1,138 views
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Cons...