Add two solution about Tree.

liril-net · liril-net · commit ba64648dc926 · 2015-12-05T18:43:41.000+08:00
diff --git a/JavaScript/Tree/Maximum-Depth-of-Binary-Tree.js b/JavaScript/Tree/Maximum-Depth-of-Binary-Tree.js
@@ -0,0 +1,38 @@
+//
+// Copyright (c) 2015 by liril.net. All Rights Reserved.
+//
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var maxDepth = function(root) {
+  var stackNode = Array(), stackHeight = Array();
+  var height = 0, max = 0;
+  while (root || stackNode.length) {
+    while (root) {
+      height++;
+      stackNode.push(root);
+      stackHeight.push(height);
+      root = root.left;
+    }
+    root = stackNode.pop();
+    height = stackHeight.pop();
+    if (!root.left && !root.right) {
+      if (!max) max = height;
+      max = Math.max(max, height);
+    }
+    root = root.right;
+  }
+  return max;
+};
+
+console.log(maxDepth([1]));
diff --git a/JavaScript/Tree/Minimum-Depth-of-Binary-Tree.js b/JavaScript/Tree/Minimum-Depth-of-Binary-Tree.js
@@ -0,0 +1,35 @@
+//
+// Copyright (c) 2015 by liril.net. All Rights Reserved.
+//
+
+/**
+ * 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) {
+  var stackNode = Array(), stackHeight = Array();
+  var height = 0, min = 0;
+  while (root || stackNode.length) {
+    while (root) {
+      height++;
+      stackNode.push(root);
+      stackHeight.push(height);
+      root = root.left;
+    }
+    root = stackNode.pop();
+    height = stackHeight.pop();
+    if (!root.left && !root.right) {
+      if (!min) min = height;
+      min = Math.min(min, height);
+    }
+    root = root.right;
+  }
+  return min;
+};
diff --git a/README.md b/README.md
@@ -41,11 +41,17 @@ Tree
 |   |   |-- Missing-Number.js
 |   |   |-- Number-of-1-Bits.js
 |   |   `-- Power-of-Two.js
-|   `-- Math
-|       `-- Reverse-Integer.js
+|   |-- Math
+|   |   `-- Reverse-Integer.js
+|   |-- String
+|   |   |-- Add-Binary.js
+|   |   `-- Basic-Calculator-II.js
+|   `-- Tree
+|       |-- Maximum-Depth-of-Binary-Tree.js
+|       `-- Minimum-Depth-of-Binary-Tree.js
 |-- README.md
 `-- package.json
 
-4 directories, 26 files
+6 directories, 30 files
 
 ```
