For one operation, if its worst-case time bound is $$\Theta (log

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

答案：TRUE