問題詳情

4.The worst casc time complexity of one union operation upon two binary heaps of total size n is
(B)O(log*n)
(A)O(1)
(C)O(logn)
(D)O(n)
(E)O(n log n)

參考答案

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