If we merge two heaps represented by complete binary trees, the

If we merge two heaps represented by complete binary trees, the time complexity is $$\Theta(N)$$ provided that the size of each heap is $$N$$.

答案：TRUE