【算法】判断一棵二叉树是否是平衡二叉树

题目描述

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

分析：

根据左右树的树高差距是否大于1，递归判断左右子树。

public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
public class Solution {
    public  boolean flag=true;
     public boolean IsBalanced_Solution(TreeNode root) {
	        if(root==null)
	            return true;
	        getTreeDepth( root);
	        return flag;
	        
	    }


	 public int getTreeDepth(TreeNode root){
	        if(root==null)
	            return 0;
	        int left=getTreeDepth(root.left);
	        int right=getTreeDepth(root.right);
	        if(left-right>1||right-left>1){
	        	flag=false;
                
	        }
	        
	        return right>left ?right+1:left+1;
	         
	    }
    
}

public boolean isBalanced(TreeNode root) {  
	    int depth=0;  
	    return isBalanced(root,depth);  
	}  
	private boolean isBalanced(TreeNode root, int depth) {  
	    if(root==null) {  
	        depth=0;  
	        return true;  
	    }  
	    int left=0,right=0;  
	    if(isBalanced(root.left,left)&&isBalanced(root.right, right)) {  
	        int diff=left-right;  
	        if(diff<=1&&diff>=-1) {  
	            depth=1+(left>right?left:right);  
	            return true;  
	        }  
	    }  
	    return false;  
	}