40. Determine the expected search cost of an optimal binary search tree for a set of n = 5 keys with the following probabilities. We assume that all searches are successful.
(A) 2.15
(B)1.15
(C)2.10
(D) 1.10
(E) 2.0

答案:登入後查看
統計: A(0), B(0), C(0), D(0), E(1) #3067446

詳解 (共 2 筆)

#7102361
1. 題目解析 題目要求計算一個最優二...
(共 1073 字,隱藏中)
前往觀看
0
0
#7102362
1. 題目解析 題目要求我們計算一個包...
(共 1164 字,隱藏中)
前往觀看
0
0