Day58

swolecoder · swolecoder · commit aed0a32eb86d · 2020-12-06T12:36:03.000-05:00
diff --git a/Day58/index.js b/Day58/index.js
@@ -0,0 +1,57 @@
+/**
+ * // Definition for a Node.
+ * function Node(val, left, right, next) {
+ *    this.val = val === undefined ? null : val;
+ *    this.left = left === undefined ? null : left;
+ *    this.right = right === undefined ? null : right;
+ *    this.next = next === undefined ? null : next;
+ * };
+ */
+
+/**
+ * @param {Node} root
+ * @return {Node}
+ */
+var connect = function (root) {
+
+
+    let queue = [root];
+
+    while (queue.length) {
+
+        let len = queue.length;
+        let previous = null;
+
+        for (let i = 0; i < len; i++) {
+
+            let currentData = queue.shift();
+
+            // console.log("Data", currentData.val)
+
+            if (!currentData) continue;
+
+            if (previous != null) {
+
+                //do stuff here
+                previous.next = currentData;
+
+            }
+            previous = currentData
+
+
+            //left
+            if (currentData.left) {
+                queue.push(currentData.left)
+            }
+
+            //right
+            if (currentData.right) {
+                queue.push(currentData.right)
+            }
+
+        }
+    }
+    return root
+
+
+};
diff --git a/README.md b/README.md
@@ -131,4 +131,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 56| [382. Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [javascript]()|[:memo:](https://leetcode.com/problems/linked-list-random-node/)|Easy|
 
-|Day 57| [1492. The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | [javascript]()|[:memo:](https://leetcode.com/problems/the-kth-factor-of-n/)|Medium|
+|Day 57| [1492. The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | [javascript]()|[:memo:](https://leetcode.com/problems/the-kth-factor-of-n/)|Medium|
+
+|Day 58| [117. Populating Next Right Pointers in Each Node II](hhttps://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|
