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.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30 |
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public
class Solution { /**This is a fundamental problem on recursive method.<br> * @param root --the root node of a tree * @return max depth * @author Averill Zheng * @version 2014-06-03 * @since JDK 1.7 */ public
int maxDepth(TreeNode root) { int
maxDepth = 0; if(root != null){ if(root.left == null) maxDepth = 1
+ maxDepth(root.right); else
if(root.right == null) maxDepth = 1
+ maxDepth(root.left); else maxDepth = 1
+ Math.max(maxDepth(root.left), maxDepth(root.right)); } return
maxDepth; }} |
leetcode--Maximum Depth of Binary Tree,布布扣,bubuko.com
leetcode--Maximum Depth of Binary Tree
原文地址：http://www.cnblogs.com/averillzheng/p/3769110.html
