主题思想: 递归计算树的层高。
AC 代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
return travel(root);
}
public int travel(TreeNode root){
if(root==null) return 0;
int left=0,right=0;
//here
left=1+travel(root.left);
//here
right=1+travel(root.right);
return Math.max(left,right);
}
}