When inserting into a B-tree, if the key is not in the tree, the search terminates at a ____.
A) leaf
B) root
C) node
D) branch

Question

Quizplus · Accepted Answer

When inserting a key into a B-tree that is not already present in the tree, the search for the correct position always terminates at a leaf node. This is because in a B-tree, all insertions occur at the leaf level to maintain the tree's balanced property.

When Inserting into a B-Tree, If the Key Is Not