635 views
0 votes
0 votes

1 Answer

Best answer
1 votes
1 votes

let order of tree be p.

case 1 : for internal node : 

size of key * #keys + tree ptr * #child pointer <=1024

15(p-1) +5p<=1024

20p<=1039

p<=51.98

p=51

------------------------------------------------------------------------------------------------

case 2 :for leaf node

(key pointer +data pointer)(p-1)+ tree pointer <=1024

20(p-1)+5<=1024

20p<=1029

p<=51.98

p=51

------------------------------------------------------------------------------------------------

so in both cases we get 51 so order of tree is 51.

selected by

Related questions

0 votes
0 votes
1 answer
1
gauravkumawat asked Jun 13, 2023
882 views
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
3
Crackcer asked Jan 10, 2022
237 views
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
2 votes
2 votes
2 answers
4