retagged by
1,535 views
0 votes
0 votes
Will block size of B tree and B+ tree same for same key size and pointer size

One more doubt

For B+ tree at leaf(Key and Record Pointer) and at non leaf node(Block pointer and Key)

So for B+ tree order for leaf node and non leaf node will be different

For B tree at leaf (Key and Record Pointer)  and at non leaf node(Block pointer ,Key and Record pointer)

But for B tree Order of leaf node and non leaf node is same

Why please say

please clear my doubt

Thank you
retagged by

1 Answer

0 votes
0 votes
Block size is independent of   key size and pointer size

Related questions

0 votes
0 votes
1 answer
1
learncp asked Sep 25, 2015
1,509 views
Here, the value of p should be 24, not 23 as taken...also no reason is given for this assumption by the author (Navathe ). Can anyone explain this ?
1 votes
1 votes
3 answers
2
Pradip Nichite asked Nov 19, 2015
1,711 views
What is the minimum and maximum space utilization of b+ tree and b tree?
0 votes
0 votes
1 answer
3
Vishnathan asked Aug 24, 2018
8,296 views
1 votes
1 votes
2 answers
4
Ayush Upadhyaya asked Mar 20, 2017
1,035 views
Searching and retrieval of data is more efficient using which tree?B Tree or B+ Tree?