10. In a Fibonacci heap of size n, the worst case time complexity of n delete-min operations is(A)O(
問題詳情
10. In a Fibonacci heap of size n, the worst case time complexity of n delete-min operations is (A)O(n) (B)O(n log*n) (C)O(n logn) (D)O(n2) (E)O(n2 10g n)