110. Balanced Binary Tree

/**
 * 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:
    int height(TreeNode* root){
        if(root==NULL)
            return 0;
        else 
            return max (height(root->left), height(root->right) )+1;
    }

    void inorderUtil(TreeNode* root, bool & ans){
        if(root!=NULL){
            inorderUtil(root->left,ans);
            int data=root->val;

            int d1=height(root->left);
            int d2=height(root->right);
            int diff=abs(d1-d2);

            if(diff>1){
                ans=ans && false;
            }

            inorderUtil(root->right,ans);
        }
    }

    bool isBalanced(TreeNode* root) {
        bool ans= true;
        inorderUtil(root,ans);
        return ans;
    }
};