Amortized Complexity
For disjoint union / find with weighted union and path compression.
- average time per operation is essentially a constant.
- worst case time for a PC-Find is O(log n).
An individual operation can be costly, but over time the average cost per operation is not.