110. 平衡二叉树
给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
答案
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private boolean res = true;
public boolean isBalanced(TreeNode root) {
d(root);
return res;
}
public int d(TreeNode root) {
if (!res || root == null) return 0;
int left = d(root.left) + 1;
int right = d(root.right) + 1;
if (!res || left - right > 1 || right - left > 1) {
res = false;
}
return Math.max(left, right);
}
}