判断一颗二叉树是否平衡。
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int heightOfTree(TreeNode root){
if(root == null) return 0;
return Math.max(heightOfTree(root.left), heightOfTree(root.right)) + 1;
}
public boolean isBalanced(TreeNode root) {
if(root == null) return true;
if((Math.abs(heightOfTree(root.left) - heightOfTree(root.right)) < 2) && isBalanced(root.left) && isBalanced(root.right)) return true;
else return false;
}
}