added comment

harshithasudhakar · web-flow · commit d8d70ae97009 · 2025-03-24T23:30:44.000+05:30
diff --git a/Binary Tree/TopViewOfBTUsingDFS.java b/Binary Tree/TopViewOfBTUsingDFS.java
@@ -58,7 +58,8 @@ static void dfs(Node root, Map<Integer, int[]> map, int hd, int level){
             return;
         }
 
-        if(!map.containsKey(hd) || map.get(hd)[1] > level){
+        if(!map.containsKey(hd) || map.get(hd)[1] > level){ // we are checking the level value at the same hd in the map. 
+                                                            //if the level value we are processing is smaller than the one already in map, we will put in the map
             map.put(hd, new int[]{root.val, l});
         }
 

Original file line number	Diff line number	Diff line change
`@@ -58,7 +58,8 @@ static void dfs(Node root, Map<Integer, int[]> map, int hd, int level){`
`58`	`58`	`return;`
`59`	`59`	`}`
`60`	`60`
`61`		`- if(!map.containsKey(hd) \|\| map.get(hd)[1] > level){`
	`61`	`+ if(!map.containsKey(hd) \|\| map.get(hd)[1] > level){ // we are checking the level value at the same hd in the map.`
	`62`	`+ //if the level value we are processing is smaller than the one already in map, we will put in the map`
`62`	`63`	`map.put(hd, new int[]{root.val, l});`
`63`	`64`	`}`
`64`	`65`