Day61

swolecoder · swolecoder · commit 673cd920e6a6 · 2020-12-12T12:24:30.000-05:00
diff --git a/Day61/index.js b/Day61/index.js
@@ -0,0 +1,45 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {TreeNode}
+ */
+var subtreeWithAllDeepest = function (root) {
+
+    let result;
+
+    function helper(node) {
+        if (!node) return;
+
+        let left = height(node.left);
+        let right = height(node.right);
+
+        if (left == right) {
+            result = node;
+            return
+        } else {
+            if (left > right) {
+                helper(node.left)
+            } else {
+                helper(node.right)
+            }
+        }
+    }
+
+    helper(root)
+    return result;
+
+
+    function height(node) {
+        if (!node) return 0;
+        let left = height(node.left);
+        let right = height(node.right);
+        return Math.max(left, right) + 1;
+    }
+};
diff --git a/README.md b/README.md
@@ -137,4 +137,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 59| [1. Two Sum](https://leetcode.com/problems/two-sum/) | [javascript]()|[:memo:](https://leetcode.com/problems/two-sum/)|Easy|
 
-|Day 60| [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|Medium|
+|Day 60| [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|Medium|
+
+|Day 61| [865. Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | [javascript]()|[:memo:](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/)|Medium|
