平衡二叉树

平衡二叉树

• 输入一棵二叉树，判断该二叉树是否是平衡二叉树
• 平衡二叉树又被称为AVL树，具有以下性质：它是一棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。它的出现就是解决二叉查找树不平衡导致查找效率退化为线性的问题，因为在删除和插入之时会维护树的平衡，使得查找时间保持在O(log2n)，比二叉查找树更稳定。

public class BalancedBinaryTree {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		int[] pre = { 1, 2, 4, 7, 3, 5, 6, 8 };// 前序遍历序列
		int[] in = { 4, 7, 2, 1, 5, 3, 8, 6 };// 中序遍历序列
		TreeNode root = reConstructBinaryTree(pre, in);// 调用重建二叉树方法 ;
		System.out.println(IsBalanced_Solution(root));
		
	}

    public static boolean IsBalanced_Solution(TreeNode root) {
        if (root == null) {
            return true;
        }
        int left = getTreeDepth(root.left);
        int right = getTreeDepth(root.right);
        int diff = left - right;
        if (diff > 1 || diff < -1)
            return false;
        return IsBalanced_Solution(root.left) && IsBalanced_Solution(root.right);
         
    }
         
    public static int getTreeDepth(TreeNode root) {
        if (root == null)
            return 0;
        else
            return Math.max(getTreeDepth(root.left), getTreeDepth(root.right)) + 1;
 
    }
    
	// 重建二叉树
	public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
		if (pre == null || in == null) {
			return null;
		}

		java.util.HashMap<Integer, Integer> map = new java.util.HashMap<Integer, Integer>();
		for (int i = 0; i < in.length; i++) {
			map.put(in[i], i);
		}
		return preIn(pre, 0, pre.length - 1, in, 0, in.length - 1, map);
	}
	
	public static TreeNode preIn(int[] p, int pi, int pj, int[] n, int ni, int nj,
			java.util.HashMap<Integer, Integer> map) {
		if (pi > pj) {
			return null;
		}
		TreeNode head = new TreeNode(p[pi]);
		int index = map.get(p[pi]);
		head.left = preIn(p, pi + 1, pi + index - ni, n, ni, index - 1, map);
		head.right = preIn(p, pi + index - ni + 1, pj, n, index + 1, nj, map);
		return head;
	}
    
}