Simplest C++ Solution ||
\n bool ans=true;\nint height(TreeNode*root){\n    if(!root)\n        return 0;\n    int l=height(root->left);\n    int r=height(root->right);\n    ans=ans& abs
```\n bool ans=true;\nint height(TreeNode*root){\n    if(!root)\n        return 0;\n    int l=height(root->left);\n    int r=height(root->right);\n    ans=ans& abs(l-r)<2;\n    return max(l,r)+1;\n}\n    bool isBalanced(TreeNode* root) {\n        height(root);\n        return ans;\n    }\n```
['C']