单选题：Let $$T$$ be a tree of $$N$$ nodes created by union-by-size with

Let $$T$$ be a tree of $$N$$ nodes created by union-by-size without path compression, then the minimum depth of $$T$$ may be @[A](3)

A. 1
B. $$logN$$
C. $$N-1$$
D. $$N/2$$




A.1
B.$$logN$$
C.$$N-1$$
D.$$N/2$$


答案：A