Q15
What is the time complexity of searching for an element in a B-Tree of order m?
A.
O(log n)
B.
O(n)
C.
O(1)
D.
O(log_m n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board