Question: What is the time complexity of the \'Find\' operation with path compression and union by rank?

Options:

1. O(n)
2. O(log n)
3. O(α(n))
4. O(1)

Correct Answer: O(α(n))

Solution:

The time complexity of the \'Find\' operation with path compression and union by rank is O(α(n)), where α is the inverse Ackermann function.