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

Leetcode: Maximum Depth of Binary Tree

时间:2014-05-05 22:44:13      阅读:328      评论:0      收藏:0      [点我收藏+]

标签:style   blog   class   code   java   color   

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

标签:style   blog   class   code   java   color   

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

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