..:: B-Trees on Data Structure and Algorithms related Questions and Answers

Question : Efficiency of finding the next record in B+ tree is ____
1. O(n)
2. O(log n)
3. O(nlog n)
4. O(1)
Answer : 4 - O(1)

* Be the First to Post a Comment.

Note : Name and Email never shown.