Leetcode 261. Graph Valid Tree

Given n labeled nodes and an undirected edge list, determine whether the edges form a valid tree — i.e., the graph is connected and contains no cycles (equivalently it has exactly n−1 edges). The core challenge is detecting cycle-freeness and ensuring all nodes are reachable.