The order of an internal node in a B+ tree index is the maximum number of…
GATE · 2004 · CS
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
- A.
24
- B.
25
- C.
26
- D.
27
Attempted by 248 students.
Sign up free to check your answer
Sign up freeLoading lesson…