If a data structure supports an operation QI such that a sequenc

If a data structure supports an operation QI such that a sequence of $$n$$ QI’s takes $$\Theta(\frac{n^2}{\log n})$$ time to perform in the worst case, then the amortized cost of a QI operation is $$\Theta(\frac{n}{\log n})$$ , while the actual time of a single QI operation could be as high as $$\Theta(\frac{n^2}{\log n})$$. ~@[](2)

答案：TRUE