111. Minimum Depth of Binary Tree
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.
解题思路:
本题简单使用递归即可解决。如果根节点为0,则返回0.如果根节点的左子树为null,则返回右子树的最小深度加1。反之亦然。如果左右结点都不为空,则返回左子树最小深度和右子树最小深度中的较小值,然后加1。
代码展示:
/**
* 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) {
if(root==NULL)
return 0;
if(root->left==NULL)
return minDepth(root->right)+1;
else if(root->right==NULL)
return minDepth(root->left)+1;
if(root!=NULL)
{
return min(minDepth(root->left),minDepth(root->right))+1;
}
else
return 0;
}
};