//和最大深度的情况不一样,注意不能直接return min(左右子叶递归)
/**
* 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;
else if (root->left && root->right) return min(minDepth(root->left), minDepth(root->right))+1;
else if (!root->left) return minDepth(root->right)+1;
else return minDepth(root->left)+1;
}
};