Making $$N$$ insertions into an initally empty binomial queue ta

Making $$N$$ insertions into an initally empty binomial queue takes $$\Theta (N log N)$$ time in the worst case. ~@[](1)

答案：FALSE