Depth of any node x in Weighted Quick-Union Algorithm
If the size of a tree starts at 1 and doubles $i$ times, it will be $2^i$ (at least -- there might be other size increases as well). If $i&gt;\log_2N$ this would give a size $&gt;N$ -- more than the total number of nodes.