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