Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is _________.

In a B+ tree, a non-leaf node of order $p$ contains at most $p$ block pointers (child pointers) and $(p - 1)$ search keys (it does not contain record pointers).

Let:

• Block size $B = 1024$ bytes

• Search key size $K = 12$ bytes

• Block pointer size $P = 8$ bytes

The condition for a non-leaf node to fit within one disk block is:

Substitute the given values:

Since $p$ must be an integer, the maximum order is $p = 51$.

The maximum number of keys that can be accommodated in each non-leaf node is: