Vidyalelo
Data Structure · Q84

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 84

Q84

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

A.
O(n)
B.
O(log n)
C.
O(nlog n)
D.
O(1)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board