Leetcode 111 Minimum Depth of Binary Tree（水）

题目连接：Leetcode 111 Minimum Depth of Binary Tree

解题思路：递归，每次返回子树中层数低的一个加一。

/**
 * 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 == NULL) return 0;

			if (root->left == NULL && root->right == NULL) return 1; 
			else if (root->left == NULL) return minDepth(root->right) + 1;
			else if (root->right == NULL) return minDepth(root->left) + 1;
			else return min(minDepth(root->left), minDepth(root->right)) + 1;
		}
};