-
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 ______.
-
- 25
- 55
- 14
- 50
Correct Option: D
Suppose that ‘k’ is order of the non-leaf node k(8) + (k – 1)12 ≤ 1024
20k ≤ 1036
| k ≤ |  |  | ⇒ k ≤ 51 | |
| 20 |
As the order is 51, maximum we can store 50 keys.
