111

Author: LuYanFCP

README.md

@@ -23,6 +23,7 @@ Leetcode刷题记录
 + No.95 [cpp](cpp/95.cpp)
 + No.77 [python](python/77.py)
 + No.97 [python](python/97.py)
++ No.111 [cpp](cpp/111.cpp)  easy
 + No.529 [cpp](cpp/529.cpp)
 + No.733 [cpp](cpp/733.cpp)
 

cpp/111.cpp

@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    int minDepth(TreeNode* root) {
+        if (!root) return 0;
+        if (!(root->left && root->right)) {
+            if (root->left) return minDepth(root->left) + 1;
+            if (root->right) return minDepth(root->right) + 1;
+        }
+        return min(minDepth(root->left), minDepth(root->right)) + 1;
+    }
+};