From dd8fa6310b568173c819cab76c864f853cce6500 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=94=90=E6=A0=91=E6=A3=AE?= <14021051@buaa.edu.cn>
Date: Sat, 3 Nov 2018 11:16:47 +0800
Subject: [PATCH] Create 111. Minimum Depth of Binary Tree.md

---
 111. Minimum Depth of Binary Tree.md | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 111. Minimum Depth of Binary Tree.md

diff --git a/111. Minimum Depth of Binary Tree.md b/111. Minimum Depth of Binary Tree.md
new file mode 100644
index 0000000..e557e0b
--- /dev/null
+++ b/111. Minimum Depth of Binary Tree.md	
@@ -0,0 +1,21 @@
+# [111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/)
+# 思路
+求二叉树的最小深度。依次分为以下情况:
+* 若为空树，则返回0；
+* 否则，若左右子树都为空，返回1；
+* 否则，若左子树为空，那么最小深度就为右子树的最小深度加1；若右子树为空，那么最小深度就为左子树的最小深度加1；
+* 否则(即左右子树都不空)，那么最小深度就是min(1+左子树最小深度, 1+右子树最小深度)；
+
+# C++
+``` C++
+class Solution {
+public:
+    int minDepth(TreeNode* root) {
+        if(root == NULL) return 0;
+        else if(root -> left == NULL && root -> right == NULL) return 1;
+        else if(root -> left == NULL) return 1 + minDepth(root -> right);
+        else if(root -> right == NULL) return 1 + minDepth(root -> left);
+        return 1 + min(minDepth(root -> left), minDepth(root -> right));
+    }
+};
+```