Figuer:
-Each node of the B-tree can contain at most 4 keys.To insert into the B-tree a record with key = 25,do the following:
A) Split the node labeled B
B) Insert the record into the node labeled B
C) Insert the record into the node labeled A
D) Split the node labeled C

Question

Figuer: 
-Each node of the B-tree can contain at most 4 keys.To insert into the B-tree a record with key = 25,do the following:
A) Split the node labeled B 
B) Insert the record into the node labeled B 
C) Insert the record into the node labeled A 
D) Split the node labeled C

Quizplus · Accepted Answer

The record with key = 25 should be inserted into the node labeled B, assuming it has space, as B-trees allow insertion into nodes that are not full. If the node is full, then splitting would be necessary, but the question does not specify that the node is full.

Figuer: -Each Node of the B-Tree Can Contain at Most 4