题解 | #判断是不是平衡二叉树#
判断是不是平衡二叉树
https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222
JZ79 判断是不是平衡二叉树
使用递归，具体做法如下图
public class Solution {
public Integer height(TreeNode root) {
if(root == null) return 0;
return Math.max(height(root.left),height(root.right)) + 1;
}
public boolean IsBalanced_Solution(TreeNode root) {
if(root == null) {
return true;
}
if(Math.abs(height(root.left) - height(root.right)) <= 1) {
return IsBalanced_Solution(root.left) && IsBalanced_Solution(root.right);
}
return false;
}
}
