首页 > 代码库 > leetcode-Minimum Depth of Binary Tree
leetcode-Minimum Depth of Binary Tree
Minimum Depth of Binary Tree
Total Accepted: 32062 Total Submissions: 110013My SubmissionsGiven 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.
Show Tags
Have you met this question in a real interview?
/**
* 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;
int l=minDepth(root->left);
int r=minDepth(root->right);
if(l==0&&r==0)
return 1;
if(l==0||r==0)
return l>r?l+1:r+1;
if(l!=0&&r!=0)
return l>r?r+1:l+1;
}
};leetcode-Minimum Depth of Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。