題目描述
思路
直接遞歸求出每個節點的左右子節點的最長路徑,然後比較是否滿足AVL樹的要求。
public class Solution {
int judge=1;
public int Judge_AVL(TreeNode root){
if(root==null)return 0;
int deep1=Judge_AVL(root.left);
int deep2=Judge_AVL(root.right);
if((deep1-deep2>1)||(deep1-deep2)<-1){judge=-1;}
return Math.max(deep1,deep2)+1;
}
public boolean IsBalanced_Solution(TreeNode root) {
int []deep=new int[1];
deep[0]=0;
Judge_AVL(root);
if(judge==1)return true;
return false;
}
}