An undirected graph is a tree iff it’s connected and has no cycles.
edges != n-1, immediately false.Trees on n nodes have exactly n-1 edges and are connected; DSU detects cycles and connectivity.
An undirected graph is a tree iff it’s connected and has no cycles.
edges != n-1, immediately false.Trees on n nodes have exactly n-1 edges and are connected; DSU detects cycles and connectivity.