力扣算法25——JZ79 判断是不是平衡二叉树
public class Solution { public boolean IsBalanced_Solution(TreeNode root) { //空树也为平衡二叉树 if(root == null) return true; int l = deep(root.left); int r = deep(root.right); if((l-r) > 1 || (r-l) &g
