feat: add solution of Minimum Depth of Binary Tree(111) with javascript.

Author: taryn2016

README.md

@@ -79,7 +79,7 @@
 | [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [Easy][E]   | [✅][107-java] | [✅][107-js] | [✅][107-kotlin] |
 | [108][108-question] | [Convert Sorted Array to Binary Search Tree][108-tips]       | [Easy][E]   | [✅][108-java] | [✅][108-js] | [✅][108-kotlin] |
 | [110][110-question] | [Balanced Binary Tree][110-tips]                             | [Easy][E]   | [✅][110-java] | [✅][110-js] | [✅][110-kotlin] |
-| [111][111-question] | [Minimum Depth of Binary Tree][111-tips]                     | [Easy][E]   | [✅][111-java] |              | [✅][111-kotlin] |
+| [111][111-question] | [Minimum Depth of Binary Tree][111-tips]                     | [Easy][E]   | [✅][111-java] | [✅][111-js] | [✅][111-kotlin] |
 | [112][112-question] | [Path Sum][112-tips]                                         | [Easy][E]   | [✅][112-java] |              | [✅][112-kotlin] |
 | [118][118-question] | [Pascal's Triangle][118-tips]                                | [Easy][E]   | [✅][118-java] |              | [✅][118-kotlin] |
 | [119][119-question] | [Pascal's Triangle II][119-tips]                             | [Easy][E]   | [✅][119-java] |              | [✅][119-kotlin] |
@@ -459,6 +459,7 @@ commit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``
 [107-js]: ./src/_107/Solution.js
 [108-js]: ./src/_108/Solution.js
 [110-js]: ./src/_110/Solution.js
+[111-js]: ./src/_111/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_111/Solution.js

@@ -0,0 +1,18 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var minDepth = function(root) {
+  if(root == null) return 0
+  if(root.left === null && root.right === null) {return 1}
+  if(root.left === null && root.right !== null) {return 1 + minDepth(root.right)}
+  if(root.left !== null && root.right === null) {return 1 + minDepth(root.left)}
+  return 1 + Math.min(minDepth(root.left),minDepth(root.right))
+};

tips/111/README.md

@@ -48,6 +48,15 @@ class Solution {
 }
 ```
 
+```JavaScript
+var minDepth = function(root) {
+  if(root == null) return 0
+  if(root.left === null && root.right === null) {return 1}
+  if(root.left === null && root.right !== null) {return 1 + minDepth(root.right)}
+  if(root.left !== null && root.right === null) {return 1 + minDepth(root.left)}
+  return 1 + Math.min(minDepth(root.left),minDepth(root.right))
+};
+```
 ## 思路 1
 
 第二种思路就是利用宽搜了，搜索到该层有叶子节点，那就返回该层宽度即可。