Consider the following \(B^+\) tree with 5 nodes, in which a node can store at…

GATE · 2025 · CS · Set 1 · Computer Science & IT

Consider the following $B^+$ tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the $B^+$ tree. Which of the following options(s) is/are CORRECT?

1. A.

   None of the nodes will split.

2. B.

   At least one node will split and redistribute.

3. C.

   The total number of nodes will remain same.

4. D.

   The height of the tree will increase.

Attempted by 242 students.