首页 > 其他 > 详细

LeetCode104 Maximum Depth of Binary Tree

时间:2015-10-17 10:37:55      阅读:156      评论: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
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!