二叉树平衡检查(Java)

题目描述

package com.msjd.tree;

public class Balance {
public boolean isBalance(TreeNode root) {
// write code here
if(root == null)return true; // 递归基
int diff = getHight(root.left) - getHight(root.right);
if(Math.abs(diff) > 1)return false;
else return isBalance(root.left) && isBalance(root.right);
}

public int getHight(TreeNode root) {
// write code here
if(root == null)return 0;
return Math.max(getHight(root.left),
getHight(root.right)) + 1;
}
}