Q40
In a B-Tree, which operation can cause a node to split?
A.
Rebalancing when the height changes.
B.
Search when a key is found.
C.
Deletion when a node is empty.
D.
Insertion when a node is full.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board