Union-Find

Category: Graphs

Difficulty: intermediate

Description: Disjoint set data structure

Time Complexity: O(α(n))

Space Complexity: O(n)

Related LeetCode Problems