chandansgowda
diff --git a/‎2001-2500/2385.py
Copy file name to clipboard
+37Lines changed: 37 additions & 0 deletions b/‎2001-2500/2385.py
Copy file name to clipboard
+37Lines changed: 37 additions & 0 deletions
@@ -0,0 +1,37 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def amountOfTime(self, root: Optional[TreeNode], start: int) -> int:
+        def dfs(node):
+            if node is None:
+                return
+            if node.left:
+                graph[node.val].append(node.left.val)
+                graph[node.left.val].append(node.val)
+            if node.right:
+                graph[node.val].append(node.right.val)
+                graph[node.right.val].append(node.val)
+            dfs(node.left)
+            dfs(node.right)
+
+        graph = defaultdict(list)
+        dfs(root)
+        visited = set()
+        queue = deque([start])
+        time = -1
+
+        while queue:
+            time += 1
+            for _ in range(len(queue)):
+                current_node = queue.popleft()
+                visited.add(current_node)
+                for neighbor in graph[current_node]:
+                    if neighbor not in visited:
+                        queue.append(neighbor)
+                        
+        return time
+