In a B+ Tree , if the search-key value is 8 bytes long , the block size is 512…
2017
In a B+ Tree , if the search-key value is 8 bytes long , the block size is 512 bytes and the pointer size is 2B , then the maximum order of the B+ Tree is ____
Attempted by 149 students.
Show answer & explanation
Correct answer: 52
Key insight: An internal B+ Tree node can hold up to m pointers and m-1 keys, and all of these must fit within one block.
Write the space constraint: m·pointer_size + (m-1)·key_size ≤ block_size.
Rearrange: m(pointer_size + key_size) ≤ block_size + key_size, so m ≤ (block_size + key_size) / (pointer_size + key_size).
Substitute given values: block_size = 512, key_size = 8, pointer_size = 2 → m ≤ (512 + 8) / (2 + 8) = 520 / 10 = 52.
Answer: the maximum order of the B+ Tree is 52.
A video solution is available for this question — log in and enroll to watch it.