GATE | GATE CS Mock 2018 | Set 2 | Question 60

In a B+ tree, if the search-key value is 12 bytes long, the block size is 1024 bytes and the block pointer is 6 bytes, then the maximum number of keys that can be accommodated in each non-leaf node of the tree is _____ .
(A) 57
(B) 54
(C) 58
(D) 56

Answer: (D)

Explanation: Let m be the order of B+ tree

m(6)+(m-1)12 <= 1024 [Note that record pointer is not needed in non-leaf nodes] m <= 57.56, so m = 57. Since maximum order is 57, maximum number of keys is 56. Option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.