C++ Leetcode 111Minimum Depth of Binary Tree

小林叔叔

于 2016-04-24 17:56:03 发布

阅读量392

点赞数 1

分类专栏：编程x

本文链接：https://blog.youkuaiyun.com/Uncle_Lin/article/details/51234743

版权

编程x 专栏收录该内容

9 篇文章

订阅专栏

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == 0) return 0;
        int depth ;
        if(root!=0) 
         {
            depth = 1;
            int L =   minDepth(root->left);
            int R =   minDepth(root->right);
            if(L && R)
            {
                int min = R>L?L:R;
                depth += min;
            }
            else if(L == 0) depth+= R;
            else if(R== 0) depth += L;
         }
         return depth;
        
        
    }
};