Union is clearly a constant time operation. Running time of find(i) is proportional to the height of the tree containing node i.If unions are done by weight (size), the depth of any element is never greater than log2n.Read less