Consider the following tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the tree. Which of the following options(s) is/are CORRECT?
Tap to open full sizeFigure description
A B^+ tree with 5 nodes. The root holds keys 6, 12, 19. It has four children, all leaves, left to right: [1, 4, 3] (as printed), [7, 9, 10], [13, 15, 17], [20, 21, 22]. Each leaf holds 3 keys, so every node is full.
- (A)
None of the nodes will split.
- (B)
At least one node will split and redistribute.
- (C)
The total number of nodes will remain same.
- (D)
The height of the tree will increase.