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

Maximum Depth of Binary Tree -- leetcode

时间:2015-05-06 23:08:25      阅读:184      评论:0      收藏:0      [点我收藏+]

标签:traversal   leetcode   

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.


基本思路:

深度优先遍历。

在leetcode上实行执行时间为18ms。


/**
 * 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) return 0;
        return max(maxDepth(root->left), maxDepth(root->right))+1;
    }
};


Maximum Depth of Binary Tree -- leetcode

标签:traversal   leetcode   

原文地址:http://blog.csdn.net/elton_xiao/article/details/45539793

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