Maximum Depth of Binary Tree

最新推荐文章于 2020-07-16 16:59:19 发布

随心而动随意而行

最新推荐文章于 2020-07-16 16:59:19 发布

阅读量421

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013009575/article/details/18942871

版权

leetcode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

Given a binarytree, find its maximum depth.

The maximumdepth is the number of nodes along the longest path from the root node down tothe farthest leaf node.

/**
 * Definitionfor binary tree
 * structTreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL),right(NULL) {}
 * };
 */
class Solution {
public:
    intmaxDepth(TreeNode *root) {
        if(root== NULL) return 0;
        int le =maxDepth(root->left)+1;
        int ri =maxDepth(root->right)+1;
        returnle>ri?le:ri;
    }
};