m0_56362045的博客

原创 剑指Offer 55-II 平衡二叉树

剑指Offer 55-II 平衡二叉树//解法一：后序遍历 + 剪枝class Solution { public boolean isBalanced(TreeNode root) { return recur(root) != -1; } private int recur(TreeNode root) { if (root == null) return 0; int left = recur(root.left);