Complex Complexity of Weighted Union + Path Compression
Tarjan proved that m weighted union and find operations on a set of n elements have worst case complexity O(m??(m, n))
For all practical purposes this is amortized constant time
In some practical cases, one or both is unnecessary because trees do not naturally get very deep.