树的结构:
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
计算树的高度:
public int getTreeHeight(TreeNode root){
if(root==null)return 0;
return Integer.max(getTreeHeight(root.left),getTreeHeight(root.right))+1;
}
简化:
public int getTreeHeight(TreeNode root){
return root==null?0:Math.max(getTreeHeight(root.left),getTreeHeight(root.right))+1;
}