The order of a leaf in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobyte, the child pointer takes 7 bytes long…
The order of a leaf in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobyte, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ..........
Show answerHide answer
Correct answer: (A) 16
Explanation
Data pointer = child pointer + search field value = 7 + 14 = 21 bytes. Maximum number of entries = 1 KB/21 bytes = 1024/21 ≈ 48.76. The book picks 16 since all other options are greater than 48.