Question: What is the time complexity of the \'find\' operation in a well-optimized Disjoint Set Union with path compression?

Options:

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

Correct Answer: O(α(n))

Solution:

The time complexity of the \'find\' operation in a well-optimized Disjoint Set Union with path compression is O(α(n)), where α is the inverse Ackermann function.