Recall that the worst-case time complexities of insertions and d

Recall that the worst-case time complexities of insertions and deletions in a heap of size $$N$$ are both $$O(\log N)$$. Then, without changing the data structure, the amortized time complexity of insertions in a heap is also $$O(\log N)$$, and that of deletions is $$O(1)$$. ~@[](3)

答案：TRUE