Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
使用dfs得到每个节点的高度,并对左右子树的高度差进行判断
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
boolean ans = true;
public boolean isBalanced(TreeNode root) {
if(root==null) return true;
helper(root, 0);
return ans;
}
private int helper(TreeNode root, int height){
if(root==null) return height-1;
int left = helper(root.left, height+1);
int right = helper(root.right, height+1);
if(Math.abs(left - right)>1) ans = false;
return Math.max(left, right);
}
}
其他人的dfs版本,从下往上的方法
public boolean isBalanced(TreeNode root) {
if(root==null){
return true;
}
return height(root)!=-1;
}
public int height(TreeNode node){
if(node==null){
return 0;
}
int lH=height(node.left);
if(lH==-1){
return -1;
}
int rH=height(node.right);
if(rH==-1){
return -1;
}
if(lH-rH<-1 || lH-rH>1){
return -1;
}
return Math.max(lH,rH)+1;
}