剪纸，这样做会方便更多吧 import java.lang.Math; public class Solution { private boolean isBalanced = true; public boolean IsBalanced_Solution(TreeNode root) { isBalancedTree(root); return isBalanced; } public Integer isBalancedTree(TreeNode root){ if (!isBalanced) return 0; if (root == null) return 0; Integer leftTree = isBalancedTree(root.left); Integer rightTree = isBalancedTree(root.right); if (Math.abs(leftTree - rightTree) > 1) isBalanced = false; return Math.max(leftTree, rightTree) + 1; } }