Maximum Depth of Binary Tree

作者: 极速魔法 | 来源:发表于2017-07-02 10:40 被阅读4次

二叉树的最大深度
树相关LeetCode题库
Leetcode PHP题解--D41 104. Maximum
Q104 Maximum Depth of Binary Tre
LeetCode104.Maximum Depth of Bin
Leetcode 104. Maximum Depth of B
104. Maximum Depth of Binary Tre
104. Maximum Depth of Binary Tre
104. Maximum Depth of Binary Tre
104. Maximum Depth of Binary Tre

//104
Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root==NULL){
            return 0;
        }

        int leftTree=maxDepth(root->left);
        int rightTree=maxDepth(root->right);

        return max(leftTree,rightTree)+1;
    }
};

网友评论

本文标题：Maximum Depth of Binary Tree

本文链接：https://www.haomeiwen.com/subject/xrencxtx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

Maximum Depth of Binary Tree

相关文章

二叉树的最大深度

树相关LeetCode题库

Leetcode PHP题解--D41 104. Maximum

Q104 Maximum Depth of Binary Tre

LeetCode104.Maximum Depth of Bin

Leetcode 104. Maximum Depth of B

104. Maximum Depth of Binary Tre

104. Maximum Depth of Binary Tre

104. Maximum Depth of Binary Tre

104. Maximum Depth of Binary Tre

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读