NC62 判断是不是平衡二叉树（C++）- 简单、树、dfs

题目链接：https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=196&rp=1&ru=%2Fexam%2Foj&qru=%2Fexam%2Foj&sourceUrl=%2Fexam%2Foj%3Fpage%3D2%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196&difficulty=&judgeStatus=&tags=&title=62&gioEnter=menu
题目如下：

class Solution {
public:
    bool IsBalanced_Solution(TreeNode* pRoot) {
        if(!pRoot) return true;
        dfs(pRoot);
        return res;
    }
    int dfs(TreeNode* root){
        if(res==false) return 0;
        if(!root) return 0;
        
        int L=dfs(root->left);
        int R=dfs(root->right);
        
        //平衡二叉树定义:一个节点的左右子树的高度之差<=1
        if(abs(L-R)>1) res=false;
        
        return max(L,R)+1;
    }
private:
    bool res=true;
};