問題詳情
【題組】(21) For a data set of N records stored in an m-way balanced search tree, what is the time complexity to search a key value in terms of the number of disk accesses in the worst case ?
(A) O(N/m log 2N)
(B) O(N log mN)
(C) O(N/m logm N/m)
(D) O(logmN)
(E) None of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增