maximum-depth-of-binary-tree

llwjason5555

于 2017-09-26 16:19:14 发布

阅读量175

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/llwjason5555/article/details/78100230

版权

leetcode 专栏收录该内容

116 篇文章

订阅专栏

题目：

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 h1=0,h2=0;
        if(root->left)
            h1=maxDepth(root->left);

        if(root->right)
            h2=maxDepth(root->right);

        return h1>h2?h1+1:h2+1;
    }
};