Leetcode Submission Details

markpen

于 2016-12-17 15:44:24 发布

阅读量285

点赞数

分类专栏：水题 leetcode 文章标签： dfs leetcode

本文链接：https://blog.youkuaiyun.com/markpen/article/details/53708188

版权

leetcode 同时被 2 个专栏收录

167 篇文章

订阅专栏

水题

112 篇文章

订阅专栏

题意：找树最浅的深度。

思路：DFS。

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == NULL) return 0;
        if(root->left == NULL && root->right == NULL) return 1;
        int deepleft = 999999;
        int deepright = 999999;
        if(root->left) deepleft = minDepth(root->left) + 1;
        if(root->right) deepright = minDepth(root->right) + 1;
        
        return deepright>deepleft?deepleft:deepright;
    }
};