問題詳情

13. In a leftist heap of size n, the worst case time complexity of one find-min operation is
(C)O(log n)
(A)O(1)
(B)O(log*n)
(D)O(n)
(E) O(n log n)

參考答案

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