balcanced-binary-tree

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int dept(TreeNode *root) {
        if(root==NULL)	return 0;
        if(root->left==NULL && root->right==NULL) 
            return 1;
        return max(dept(root->left),dept(root->right))+1;
    }
    
    bool isBalanced(TreeNode *root) {
        if(root==NULL)	return true;
        int x=dept(root->left)-dept(root->right);
        if(abs(x)>1)
            return false;
        else
            return isBalanced(root->left) && isBalanced(root->right);
    }
};