+1 vote
in Data Structures & Algorithms I by (110k points)
Efficiency of finding the next record in B+ tree is ____

(a) O(n)

(b) O(log n)

(c) O(nlog n)

(d) O(1)

The above asked question is from B-Trees in chapter B-Trees of Data Structures & Algorithms I

The question was asked in exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (d) O(1)

Best explanation: In a B+ -tree finding the next recored (successor) involves accessing an additional leaf at most. So, the efficiency of finding the next record is O(1).

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.

Categories

...