/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int minDepth(struct TreeNode* root) {
if(root==NULL)
{
return 0;
}
if(root->left&&root->right)
{
int left=1+minDepth(root->left);
int right=1+minDepth(root->right);
return fmin(left,right);
}
if(root->left&&!root->right)
{
int left=1+minDepth(root->left);
return left;
}
if(root->right&&!root->left)
{
int right=1+minDepth(root->right);
return right;
}
return 1;
}
有空多敲