单选题：Start from $$N$$ single-node splay trees, let's merge them into
Start from $$N$$ single-node splay trees, let's merge them into one splay tree in the following way: each time we select two splay trees, delete nodes one by one from the smaller tree and insert them into the larger tree. Then which of the following statements is NOT true? @[D](2)
A. In any sequence of $$N-1$$ merges, there are at most $$O(N\log N)$$ inserts.
B. Any node can be inserted at most $$\log N$$ times.
C. The amortized time bound for each insertion is $$O(\log ^2 N)$$.
D. The amortized time bound for each merge is $$O(\log N)$$.
A.In any sequence of $$N-1$$ merges, there are at most $$O(N\log N)$$ inserts.
B.Any node can be inserted at most $$\log N$$ times.
C.The amortized time bound for each insertion is $$O(\log ^2 N)$$.
D.The amortized time bound for each merge is $$O(\log N)$$.
答案：D
A. In any sequence of $$N-1$$ merges, there are at most $$O(N\log N)$$ inserts.
B. Any node can be inserted at most $$\log N$$ times.
C. The amortized time bound for each insertion is $$O(\log ^2 N)$$.
D. The amortized time bound for each merge is $$O(\log N)$$.
A.In any sequence of $$N-1$$ merges, there are at most $$O(N\log N)$$ inserts.
B.Any node can be inserted at most $$\log N$$ times.
C.The amortized time bound for each insertion is $$O(\log ^2 N)$$.
D.The amortized time bound for each merge is $$O(\log N)$$.
答案：D