The order of a leaf node in a B+ tree is the maximum number of (value, data…

PYQ GATE 2007

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?

  1. A.

    63

  2. B.

    64

  3. C.

    67

  4. D.

    68

Attempted by 469 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…