题目:
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
代码如下:
int depth(TreeNode *root)
{
if(root==NULL)return 0;
int nleft=depth(root->left);
int nright=depth(root->right);
int max;
if(nleft==0)max=nright;
else if(nright==0)max=nleft;
else
{
max=nleft<nright?nleft:nright;
}
return max+1;
}
int minDepth(TreeNode *root) {
return depth(root);
}