Q. 40 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_______.
Answer: (B)
Explanation:
