From 8b9f4da843e83a7460b3e38ef93d7eb02fb00756 Mon Sep 17 00:00:00 2001 From: Vishal desai Date: Wed, 24 Aug 2022 09:43:04 -0700 Subject: [PATCH] Update 261-Graph-Valid-Tree.java For a graph without 0 value it will give exception so better to take first node as a root --- java/261-Graph-Valid-Tree.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/java/261-Graph-Valid-Tree.java b/java/261-Graph-Valid-Tree.java index 5c1e8226a..f55511370 100644 --- a/java/261-Graph-Valid-Tree.java +++ b/java/261-Graph-Valid-Tree.java @@ -18,7 +18,7 @@ public boolean validTree(int n, int[][] edges) { Set visited = new HashSet<>(); - return depthFirstSearch(0, -1, visited) && visited.size() == n; + return depthFirstSearch(edges[0][0], -1, visited) && visited.size() == n; } private boolean depthFirstSearch(