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

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

答案：FALSE