問題詳情

40. Determine the expected search cost of an optimal binary search tree for a set of n = 5 keys with thefollowing probabilities. We assume that all searches are successful.


(A) 2.15
(B)1.15
(C)2.10
(D) 1.10
(E) 2.0

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增