Efficiency of finding the next record in B+ tree is ____

Category: QuestionsEfficiency of finding the next record in B+ tree is ____
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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).