leetcode--Maximum Depth of Binary Tree

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.

[java]  view plain  copy

1. /** 
2.  * Definition for a binary tree node. 
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.         else{  
14.             int left = maxDepth(root.left);  
15.             int right = maxDepth(root.right);  
16.             return left>right?left+1:right+1;  
17.         }  
18.     }  
19. } 

原文链接http://blog.youkuaiyun.com/crazy__chen/article/details/46378557