// Balanced Binary Tree

// Given a binary tree, determine if it is height-balanced.

// For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.



//My solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isBalanced(TreeNode* root) 
    {
        int i = 0;
        return isBalancedTree(root,i);
        
    }
    
    bool isBalancedTree(TreeNode* root,int& height)
    {
        if(root == nullptr)
        {
            height = 0;
            return true;
        }
        int leftHeight,rightHeight;
        
        bool isLeft = isBalancedTree(root->left,leftHeight);
        bool isRight = isBalancedTree(root->right,rightHeight);
        
        height = max(leftHeight,rightHeight)+1;
        
        if(isLeft && isRight && abs(leftHeight-rightHeight)<=1)
        {
            return true;
        }
        else
            return false;
    }
};