标签：des style color io java ar for div sp
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.
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxDepth(TreeNode root) {
if(root==null)
{
return 0;
}
return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
}
}标签：des style color io java ar for div sp
原文地址：http://blog.csdn.net/jiewuyou/article/details/39473069
