The order of a leaf node in a B+ tree is the maximum number of (value, data…
2016
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
- A.
63
- B.
64
- C.
67
- D.
68
Attempted by 127 students.
Show answer & explanation
Correct answer: A
The order of a B+ tree leaf node is the maximum number of (value, data record pointer) pairs it can hold. Block size = 1024 bytes. Subtract next-block pointer (6 bytes): 1024 - 6 = 1018 bytes available. Each pair size = value (9) + data pointer (7) = 16 bytes. Max pairs = floor(1018 / 16) = 63.
A video solution is available for this question — log in and enroll to watch it.