首页 > 其他 > 详细

Leetcode: Maximum Depth of Binary Tree

时间:2014-05-05 22:43:33      阅读:395      评论:0      收藏:0      [点我收藏+]
bubuko.com,布布扣
 1 /**
 2  * Definition for binary tree
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public int maxDepth(TreeNode root) {
12         if(root==null) return 0;
13         return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
14     }
15 }
bubuko.com,布布扣

 

Leetcode: Maximum Depth of Binary Tree,布布扣,bubuko.com

Leetcode: Maximum Depth of Binary Tree

原文:http://www.cnblogs.com/EdwardLiu/p/3704785.html

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