判断二叉树是不是平衡

声明：本文章是学习了何海涛的网易日志后自学习的总结。

题目：输入一棵二叉树的根结点，判断该树是不是平衡二叉树。如果某二叉树中任意结点的左右子树的深度相差不超过1，那么它就是一棵平衡二叉树。

思路：方法一：我们首先可以想到的就是递归，这个方法不多做阐述。

class TreeNode{
	int val;
	TreeNode left;
	TreeNode right;
	public TreeNode(int val){
		this.val = val;
	}
}

public class IsBalancedTree {
	public static void main(String[] args){
		TreeNode root = new TreeNode(1);
		TreeNode rootLeft = new TreeNode(2);
		TreeNode rootRight = new TreeNode(3);
		TreeNode p1 = new TreeNode(4);
		TreeNode p2 = new TreeNode(5);
		
		root.left = rootLeft;
		root.right = rootRight;
		rootLeft.left = p1;
		rootLeft.right =null;
		p1.right = null;
		p1.left = p2;
		p2.left = p2.right =null;
		
		rootRight.left = rootRight.right = null;
		
		boolean result = IsBalancedI(root);
		System.out.println(result);
	}

 /**
     * 方法一：递归判断
     * @param root
     * @return
     */
	public static boolean IsBalancedI(TreeNode root){
		if(root == null)
			return true;
		
		boolean left = IsBalancedI(root.left);
		if(!left)
			return false;
		boolean right = IsBalancedI(root.right);
		if(!right)
			return false;
		
		int leftHeight = height(root.left);
		int rightHeight = height(root.right);
		if(Math.abs(leftHeight - rightHeight)>1)
			return false;
		return true;
	}

public static int height(TreeNode root){
		if(root == null)
			return 0;
		
		int left = height(root.left);
		int right = height(root.right);
		
		return left>right?left+1:right+1;
	}

}

方法二：何海涛日志中提到的后续遍历的方法，这个方法和递归方法其实很类似，但是不同点在于，传参的时候，这种方法传了两个参数，一个是TreeNode，另外一个是表示节点深度，刚开始的时候，深度都为0，在程序运行中，修改深度的值。

这里就要用到参数传递中的引用传递，首先我们可能会想到用Integer来进行引用传递，但是Integer中的value为final类型，如果我们通过valueOf方法改变value值，则返回的是一个新new的Integer对象，不能达到引用传参的效果，所以我们需要自己写一个类Depth来达到引用传参的效果。

代码如下：

class TreeNode{
	int val;
	TreeNode left;
	TreeNode right;
	public TreeNode(int val){
		this.val = val;
	}
}
class Depth{
	int height;
	public Depth(int val){
		height = val;
	}
	public void setHeight(int val){
		height = val;
	}
	public int getHeight(){
		return height;
	}
}

public class IsBalancedTree {
	public static void main(String[] args){
		TreeNode root = new TreeNode(1);
		TreeNode rootLeft = new TreeNode(2);
		TreeNode rootRight = new TreeNode(3);
		TreeNode p1 = new TreeNode(4);
		TreeNode p2 = new TreeNode(5);
		
		root.left = rootLeft;
		root.right = rootRight;
		rootLeft.left = p1;
		rootLeft.right =null;
		p1.right = null;
		p1.left = p2;
		p2.left = p2.right =null;
		
		rootRight.left = rootRight.right = null;
		
		boolean result = IsBalancedII(root,new Depth(0));
		System.out.println(result);
	}

/**
	 * 方法二：后续遍历，一遍查完整个二叉树
	 * @param root
	 * @return
	 */
	public static boolean IsBalancedII(TreeNode root,Depth depth){
		if(root == null){
			depth.setHeight(0);
			return true;
		}
		
		Depth left = new Depth(0), right = new Depth(0);
		if(IsBalancedII(root.left,left) && IsBalancedII(root.right,right)){
			int diff = left.getHeight() - right.getHeight();
			if(Math.abs(diff)<1){
				depth.setHeight(1 + (left.getHeight()>right.getHeight()?left.getHeight():right.getHeight()));
				return true;
			}
		}
		return false;
			
	}

	

}