平衡二叉树Java实现

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

if (Math.abs(getHeight(root.left) - getHeight(root.right)) > 1)
return false;

return IsBalanced_Solution(root.left) && IsBalanced_Solution(root.right);
}
public int getHeight(TreeNode root) {
if (root == null)
return 0;
return max(getHeight(root.left), getHeight(root.right)) + 1;
}

private int max(int a, int b) {
return (a > b) ? a : b;
}
}