必须是到叶节点
/**
* Definition for binary tree
* 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 && root->right)
return min( minDepth( root->left), minDepth( root->right)) + 1;
else if( root->left)
return minDepth( root->left) + 1;
else if( root->right)
return minDepth( root->right) + 1;
else
return 1;
}
};