题目:
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.
解题:求最大深度 和前面一题类似 用递归遍历就可以
代码:
public static int maxDepth(TreeNode root) {
if(root==null)//递归返回或结束条件
return 0;
else {
return 1+Math.max(maxDepth(root.left),maxDepth(root.right) );
}
}