题目: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. 题目源自于leetcode,是二叉树中从根节点到叶子节点的最小深度。
思路:分情况讨论,没有孩子的结点是叶子,这时候递归应该返回。只有一个孩子的结点,应该返回这个子树的最小深度。有两个孩子的结点,应该比较两个子树的最小深度并返回较小的一个。
代码:
/**
* 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;
else if(root->left == NULL && root->right == NULL)
{
return 1;
}
else if(root->left != NULL && root->right == NULL)
{
return minDepth(root->left) + 1;
}
else if(root->left == NULL && root->right != NULL)
{
return minDepth(root->right) + 1;
}
else
{
int left_min = minDepth(root->left);
int right_min = minDepth(root->right);
return (left_min<right_min?left_min:right_min)+1;
}
}
};