Update 863-All-Nodes-Distance-K-in-Binary-Tree.java

SharmaTushar1 · web-flow · commit e527e8e5fb7c · 2022-06-23T21:43:08.000+05:30
diff --git a/java/863-All-Nodes-Distance-K-in-Binary-Tree.java b/java/863-All-Nodes-Distance-K-in-Binary-Tree.java
@@ -1,4 +1,4 @@
-//Just store the value for parent values in a map and just do bfs as we do in graph.
+//Just store the value for parent values of the nodes in a map and just do bfs as we do in graph.
 
 class Solution {
     public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {
@@ -20,6 +20,8 @@ public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {
                 }
             }
         }
+        //Now do the bfs 
+        //Same as we do in graphs with a visited set
         Queue<TreeNode> q2 = new LinkedList<>();
         HashSet<TreeNode> vis = new HashSet<>();
         List<Integer> ans = new ArrayList<>();

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-//Just store the value for parent values in a map and just do bfs as we do in graph.`
	`1`	`+//Just store the value for parent values of the nodes in a map and just do bfs as we do in graph.`
`2`	`2`
`3`	`3`	`class Solution {`
`4`	`4`	`public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {`
`@@ -20,6 +20,8 @@ public List<Integer> distanceK(TreeNode root, TreeNode target, int k) {`
`20`	`20`	`}`
`21`	`21`	`}`
`22`	`22`	`}`
	`23`	`+ //Now do the bfs`
	`24`	`+ //Same as we do in graphs with a visited set`
`23`	`25`	`Queue<TreeNode> q2 = new LinkedList<>();`
`24`	`26`	`HashSet<TreeNode> vis = new HashSet<>();`
`25`	`27`	`List<Integer> ans = new ArrayList<>();`