单选题：To build a leftist heap, we can start from placing all the keys

To build a leftist heap, we can start from placing all the keys as single-node heaps on a queue, and perform the following until only one heap is on the queue: dequeue two heaps, merge them, and enqueue the result.

Then the best description of the time complexity of this procedure is:@[A](3)

A. $$O(N)$$
B. $$O(\log N)$$
C. $$O(N\log N)$$
D. $$O(\sqrt N)$$



A.$$O(N)$$
B.$$O(\log N)$$
C.$$O(N\log N)$$
D.$$O(\sqrt N)$$


答案：A