For one operation, if its amortized time bound is $$O(logN)$$, t

For one operation, if its amortized time bound is $$O(logN)$$, then its worst-case time bound must be $$O(logN)$$. ~@[](1)

答案：FALSE