码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode104 Maximum Depth of Binary Tree

时间:2015-10-17 10:40:07      阅读:131      评论:0      收藏:0      [点我收藏+]

标签:

LeetCode 104 Maximum Depth of Binary Tree

https://leetcode.com/problems/maximum-depth-of-binary-tree/

 

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

 

LeetCode104 Maximum Depth of Binary Tree

标签:

原文地址:http://www.cnblogs.com/walker-lee/p/4887007.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!