For a skew heap with $$N$$ nodes, the worst-case running time of

For a skew heap with $$N$$ nodes, the worst-case running time of all operations (insert/delete min/merge) is $$O(N)$$. ~@[](1)

答案：TRUE