Time Complexity

In this method FIND takes O(1) and UNION takes O(n)

Later, we’ll see that using Up-trees, we can make the time complexity almost O(n) for a full sequence of n FIND and n UNION operations.

Previous slide

Back to first slide

View graphic version