LeetCode 261: Graph Valid Tree — Step-by-Step Visual Trace

Given n nodes and a list of undirected edges, determine if the edges form a valid tree. A valid tree must be connected and have exactly n-1 edges with no cycles.