主题思想: 递归求解,判断是不是平衡而叉树。
AC 代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isBalanced(TreeNode root) {
if(root==null) return true;
int lh=getHeight(root.left);
int rh=getHeight(root.right);
if(Math.abs(lh-rh)>1) return false;
return isBalanced(root.left)&&isBalanced(root.right);
}
public int getHeight(TreeNode root){
if(root==null) return 0;
return 1+Math.max(getHeight(root.left),getHeight(root.right));
}
}