Gate2017 ss Q61

0. In a B+ tree, if the search key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _____.

Note – Numerical Type question

Answer
Comment
Array

Option : A
Explanation :
Let the Order of the tree to be p. Every b+ tree node contains p children and p-1 data items where record pointer are not present in the internal nodes. So
p(Block pointer size)+(p-1)Key size<=Block size
p(2)+(p-1)8<=512
p=52

Forgot your password?

I agree with the Terms.