题目:
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.
解题思路:类似求最大深度的求解,采用递归算法。
代码:
/**
* 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) {
int result = 0;
if(root== NULL)
{
return 0;
}
else
{
int leftlen = minDepth(root->left);
int rigthlen = minDepth(root->right);
if(leftlen >= rigthlen)
{
result = rigthlen+1;
}
else
{
result = leftlen+1;
}
return result;
}
}
};