Question

A B + tree has a search value field of 12 Bytes, a record pointer of bytes, and a block pointer of 8 bytes with block size 1024. What is the maximum number of keys that can be accommodated in a non-leaf node?

Answer 1

Correct answer is 50

Suppose that ‘k’ is order of the non-leaf node 

k(8) + (k-1)12 ≤ 1024 

20k ≤ 1036

As the order is 51, maximum we can store 50 keys