Leetcode 261. Graph Valid Tree - Union-Find method

See other videos @codeyao9796
A Python Union-Find solution to Leetcode 261 - Graph Valid Tree. A graph is a tree if it consists of only 1 single connected component with n - 1 edges where n is the number of vertices. In this solution, we first treated the side cases by examining the n_edges == n_nodes - 1, then we traverse the edges to see if adding the current edge will yield a cycle. The way to check if cycle occurs is the union operation.

It might be helpful to look at some similar problems such as:

Leetcode 990. Satisfiability of Equality Equations - Union-Find method

Leetcode 547. Number of Provinces - Union-Find method

and ect