2,031 views

1 Answer

4 votes
4 votes
B+ tree of order n have i) n pointers  ii) n-1 keys   

In B+ tree values are stored only at leaf nodes it is a enhancement over B tree so number of values leaf nodes can stores

Ceil(n/2) to n  so n/2 space is empty that's why space utilization is 50%

Related questions

2 votes
2 votes
1 answer
1
radha gogia asked Dec 10, 2015
1,639 views
If I have n elements in the heap then why does the index of leaf nodes ranges from index ⌊n/2⌋+1 to index n ?
1 votes
1 votes
3 answers
2
Pradip Nichite asked Nov 19, 2015
1,713 views
What is the minimum and maximum space utilization of b+ tree and b tree?
4 votes
4 votes
3 answers
3
rickeshjohn asked Dec 25, 2015
3,365 views
a) lower line efficiencyb) higher line efficiencyc) no change in line efficiencyd) no relation between line efficiency and frame size
0 votes
0 votes
1 answer
4
iarnav asked Nov 8, 2018
1,944 views
Sender Window Size is 7 and every 3rd packet is lost/corrupted. So, how to find channel utilization!?