LeetCode 112 Minimum Depth of Binary Tree

发布时间：2020-12-14 03:22:59 所属栏目：大数据来源：网络整理

导读：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. Note:?A leaf is a node with no children. Example: Given binary tree? [3,9,20,nul

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.

Note:?A leaf is a node with no children.

Example:

Given binary tree?[3,9,20,null,15,7],

return its minimum?depth = 2.

求最小的深度，二叉树，这道题目我认为数据是有问题的，所以有176个踩，

c++

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root==NULL) return 0;
        int lmin =0;
        int rmin =0;
        if(root->left!=NULL)
         lmin = minDepth(root->left);
        if(root->right!=NULL)
         rmin = minDepth(root->right);
        if(lmin==0)
            return rmin+1;
        if(rmin==0)
            return lmin+1;
        return min(lmin,rmin)+1;
        
        
        
        
    }
};

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!