+1 vote
in Data Structures & Algorithms I by (110k points)
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

(a) 14

(b) 7

(c) 11

(d) 5

Query is from B-Trees in division B-Trees of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (c) 11

For explanation: If s splits occur in a B-tree, 2s + 1 nodes are written (2 halves of each split and the parent of the last node split). So, if 5 splits occurred, then 2 * 5 + 1, i.e. 11 nodes are written.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.