[LeetCode] Maximum Depth of Binary Tree

swingspring

于 2015-09-29 23:41:50 发布

阅读量361

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/skywn/article/details/48814381

版权

LeetCode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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.

递推算法 4ms AC

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {
    if(root!=NULL)
        {
            int leftlength=maxDepth(root->left);
            int rightlength=maxDepth(root->right);
            return leftlength>rightlength? leftlength+1:rightlength+1;
            
        }
    else
        return 0;  
 }