75

swolecoder · swolecoder · commit 894054079c6a · 2020-12-22T03:55:12.000-05:00
diff --git a/Day75/index.js b/Day75/index.js
@@ -0,0 +1,32 @@
+/**
+ * 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 {boolean}
+ */
+var isBalanced = function(root) {
+    let flag = true
+
+    height(root);
+    return flag;
+
+    function height(node){
+        if(!node)return 0;
+
+        if(!flag) return;
+
+        let left = height(node.left);
+        let right = height(node.right);
+
+        //check
+        if(Math.abs(left-right) > 1)flag = false
+
+        return Math.max(left,right)+1
+    }
+};
diff --git a/README.md b/README.md
@@ -166,4 +166,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 73| [910. Smallest Range II](https://leetcode.com/problems/smallest-range-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/smallest-range-ii/)|Easy|
 
-|Day 74| [1602. Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/) | [javascript]()|[:memo:](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/)|Medium|
+|Day 74| [1602. Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/) | [javascript]()|[:memo:](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/)|Medium|
+
+|Day 75| [110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [javascript]()|[:memo:](https://leetcode.com/problems/balanced-binary-tree/)|Easy|
