9. In a Fibon nacci heap of size n, the worst case time complexity of one decr(C)O(log n)e-key opera
問題詳情
9. In a Fibon nacci heap of size n, the worst case time complexity of one decr (C)O(log n)e-key operations is (A)O(1) (B)O(log*n) (D)O(n) (E) O(n log n)