check_height_balanced_binarytree.cpp

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool flag=true;
    int maxDepth(TreeNode* root){
        if(root==NULL)
            return 0;
        int l=maxDepth(root->left);
        int r=maxDepth(root->right);
        if(abs(l-r)>1)
            flag=false;
        return 1+max(l,r);
    }
    bool isBalanced(TreeNode* root) {
        maxDepth(root);
        return flag;
    }
};