首页 > 其他 > 详细

104. Maximum Depth of Binary Tree

时间:2016-09-11 23:01:10      阅读:238      评论:0      收藏:0      [点我收藏+]

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.

 

 public int MaxDepth(TreeNode root) {
        if(root == null) return 0;
        return Math.Max(MaxDepth(root.left)+1,MaxDepth(root.right)+1 );
    }

 

104. Maximum Depth of Binary Tree

原文:http://www.cnblogs.com/renyualbert/p/5863026.html

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