判断二叉树是否平衡java

/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isValidBST(TreeNode root) {
TreeNode left=null,right=null;
boolean flag = true;
if(root != null){
left = root.left;
while(left != null){
if(left.val >= root.val){
return false;
}
left = left.right;
}
right = root.right;
while(right != null){
if(right.val <= root.val){
return false;
}
right = right.left;
}
flag = isValidBST(root.left);
if(!flag){
return false;
}else{
return isValidBST(root.right);
}
}
return flag;
}
}