Consider a B+ Tree where the maximum number of key values in each leaf node is…

GATE · 2026 · DA · Data Science & AI

Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-leaf node is 3. Let the content of the B+ Tree be as shown in the figure.

Which of the following options denotes the key value(s) stored in the root node after inserting a key value 3 in the given B+ Tree?

B+ tree with root keys 5 and 8 and three pointers to leaves containing (1, 5), (7, 8) and (9, 12), respectively. Leaves are linked left to right, ending at NULL; each key has a dashed downward record pointer.
  1. A.

    5

  2. B.

    8

  3. C.

    3 and 5

  4. D.

    3, 5 and 8

Attempted by 26 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…