add 2385

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -35,6 +35,7 @@
 | 2404 | [Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2404.java)                                                                     || Easy                                                                          ||
 | 2399 | [Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/)                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2399.java)                                                                     || Medium                                                                        ||
 | 2395 | [Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)                                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2395.java)                                                                     || Easy                                                                          ||
+| 2385 | [Amount of Time for Binary Tree to Be Infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/)                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2380.java)                                                                     || Medium                                                                        ||BFS
 | 2380 | [Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2380.java)                                                                     || Medium                                                                        ||
 | 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2379.java)                                                                     || Easy                                                                          ||
 | 2373 | [Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix/)                                                                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2373.java)                                                                     || Easy                                                                          ||

Diff for: src/main/java/com/fishercoder/solutions/_2385.java

@@ -0,0 +1,61 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.*;
+
+public class _2385 {
+    public static class Solution1 {
+        public int amountOfTime(TreeNode root, int start) {
+            Map<Integer, List<Integer>> adjList = new HashMap<>();
+            buildAdjList(root, adjList);
+            Queue<Integer> q = new LinkedList<>();
+            q.offer(start);
+            Set<Integer> visited = new HashSet<>();
+            visited.add(start);
+            int times = -1;
+            while (!q.isEmpty()) {
+                int size = q.size();
+                for (int i = 0; i < size; i++) {
+                    Integer curr = q.poll();
+                    if (adjList.containsKey(curr)) {
+                        for (int node : adjList.get(curr)) {
+                            if (visited.add(node)) {
+                                q.offer(node);
+                            }
+                        }
+                    }
+                }
+                times++;
+            }
+            return times;
+        }
+
+        private void buildAdjList(TreeNode root, Map<Integer, List<Integer>> adjList) {
+            if (root == null) {
+                return;
+            }
+            if (root.left != null) {
+                List<Integer> list = adjList.getOrDefault(root.val, new ArrayList<>());
+                list.add(root.left.val);
+                adjList.put(root.val, list);
+
+                list = adjList.getOrDefault(root.left.val, new ArrayList<>());
+                list.add(root.val);
+                adjList.put(root.left.val, list);
+            }
+
+            if (root.right != null) {
+                List<Integer> list = adjList.getOrDefault(root.val, new ArrayList<>());
+                list.add(root.right.val);
+                adjList.put(root.val, list);
+
+                list = adjList.getOrDefault(root.right.val, new ArrayList<>());
+                list.add(root.val);
+                adjList.put(root.right.val, list);
+            }
+            buildAdjList(root.left, adjList);
+            buildAdjList(root.right, adjList);
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/_2385Test.java

@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._2385;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2385Test {
+    private static _2385.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2385.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.amountOfTime(TreeUtils.constructBinaryTree(Arrays.asList(1, 5, 3, null, 4, 10, 6, 9, 2)), 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.amountOfTime(TreeUtils.constructBinaryTree(Arrays.asList(2, 5)), 5));
+    }
+
+}