首页 > 其他 > 详细

Maximum Depth of Binary Tree

时间:2015-06-20 15:34:01      阅读:241      评论:0      收藏:0      [点我收藏+]

Description:

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.

Code:

    int maxDepth(TreeNode* root) {
        //先用递归算法求解
        if ( root == NULL )
            return 0;
        else
            return 1+max(maxDepth(root->left), maxDepth(root->right));
    }

 

Maximum Depth of Binary Tree

原文:http://www.cnblogs.com/happygirl-zjj/p/4590593.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!