Time Complexity

In the straight array method, FIND takes O(1) and UNION takes O(n)

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

Previous slide

Next slide

Back to first slide

View graphic version