题解 | #递归——判断是不是平衡二叉树#

#include <cstddef>
class Solution {
  public:
    int deep(TreeNode* root){
        if(root == NULL) return 0;
        int left = deep(root->left);
        int right = deep(root->right);
        return (left > right) ? left+1:right+1;
    }
    bool IsBalanced_Solution(TreeNode* pRoot) {
        if(pRoot == NULL) return true;
        int left = deep(pRoot->left);
        int right = deep(pRoot->right);
        if(abs(left-right) >1) return false;
        return IsBalanced_Solution(pRoot->left) && IsBalanced_Solution(pRoot->right);
    }
};