In *Union/Find* algorithm, if *Unions* are done by size, the dep

In *Union/Find* algorithm, if *Unions* are done by size, the depth of any node must be no more than $$N/2$$, but not $$O(logN)$$. ~@[](1)

答案：FALSE