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

Maximum Depth of Binary Tree

时间:2015-07-28 17:59:29      阅读:96      评论:0      收藏:0      [点我收藏+]

标签:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root==NULL) return 0;
        return max(dep(root->left,1),dep(root->right,1));
    }
    int dep(TreeNode* root,int pre_h){
        if(root==NULL) return pre_h;
        if(root->left ==NULL && root->right ==NULL) return pre_h+1;
        return max(dep(root->left,pre_h+1),dep(root->right,pre_h+1));
    }
};

Maximum Depth of Binary Tree

Maximum Depth of Binary Tree

标签:

原文地址:http://www.cnblogs.com/julie-yang/p/4683316.html

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