Merge pull request #383 from Kalpana8055/main

Day 14 q1: Amount of Time for Binary Tree to be Infected #350 solved

Author: kratika-Jangid

Day-14/q1: Amount of Time for Binary Tree to be Infected /kalpana--c++.md

@@ -0,0 +1,51 @@
+class Solution {
+public:
+    int amountOfTime(TreeNode* root, int start) {
+        unordered_map<int, unordered_set<int>> map;
+        convert(root, 0, map);
+        queue<int> q;
+        q.push(start);
+        int minute = 0;
+        unordered_set<int> visited;
+        visited.insert(start);
+
+        while (!q.empty()) {
+            int levelSize = q.size();
+            while (levelSize > 0) {
+                int current = q.front();
+                q.pop();
+
+                for (int num : map[current]) {
+                    if (visited.find(num) == visited.end()) {
+                        visited.insert(num);
+                        q.push(num);
+                    }
+                }
+                levelSize--;
+            }
+            minute++;
+        }
+        return minute - 1;
+    }
+
+    void convert(TreeNode* current, int parent, unordered_map<int, unordered_set<int>>& map) {
+        if (current == nullptr) {
+            return;
+        } 
+        if (map.find(current->val) == map.end()) {
+            map[current->val] = unordered_set<int>();
+        }
+        unordered_set<int>& adjacentList = map[current->val];
+        if (parent != 0) {
+            adjacentList.insert(parent);
+        } 
+        if (current->left != nullptr) {
+            adjacentList.insert(current->left->val);
+        } 
+        if (current->right != nullptr) {
+            adjacentList.insert(current->right->val);
+        }
+        convert(current->left, current->val, map);
+        convert(current->right, current->val, map);
+    }
+};