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

leetcode No104. Maximum Depth of Binary Tree

时间:2016-08-22 10:53:34      阅读:132      评论:0      收藏:0      [点我收藏+]

标签:

Question:

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.

找二叉树的最大深度

Algorithm:

递归,两种写法

Accepted Code:

写法1、
/**
 * 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) {
        int deep=0;
        if(root!=NULL)
        {
            int deep_left = maxDepth(root->left);
            int deep_right = maxDepth(root->right);
            deep = (deep_left > deep_right)?deep_left+1:deep_right+1;
        }
        return deep;
    }
};
写法2、
/**
 * 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) {
        int res=0;
        helper(root,0,&res);
        return res;
    }
    void helper(TreeNode* root,int index,int *max)
    {
        if(root==NULL)
        {
            if(*max<index)
                *max=index;
            return;
        }
        else
        {
            helper(root->left,index+1,max);
            helper(root->right,index+1,max);
        }
    }
};



leetcode No104. Maximum Depth of Binary Tree

标签:

原文地址:http://blog.csdn.net/u011391629/article/details/52274009

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