输入一棵二叉树，判断该二叉树是否是平衡二叉树。

public class Solution{
boolean flag = true;
int maxDepth = 0;
public boolean IsBalanced_Solution(TreeNode root) {
int left = 0;
int right = 0;
if (root == null) {
// 空树也是一颗平衡二叉树
return true;
}
IsBalanced_Solution(root.left);
// 当前节点左子树深度
left = maxDepth_left(root.left, 0);
maxDepth = 0;
// 当前节点右子树深度
right = maxDepth_left(root.right, 0);
if ((left - right) > 1 || (right - left) > 1) {
flag = false;
return flag;
}
IsBalanced_Solution(root.right);
return flag;


}


// 获取每个节点的最大深度
public int maxDepth_left(TreeNode root, int depth) {
if (root == null) {
return 0;
}
depth++;
maxDepth_left(root.left, depth);
if (maxDepth  < depth) {
maxDepth= depth;
}
maxDepth_left(root.right, depth);
if (maxDepth < depth) {
maxDepth = depth;
}
depth--;
return maxDepth;
}



}