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.

class Solution {
public:
bool isBalanced(TreeNode* root) {
if(!root) return true;
if(abs(getDepth(root->left)-getDepth(root->right))>1) return false;
if(!isBalanced(root->left)||!isBalanced(root->right)) return false;
return true;
}
int getDepth(TreeNode* root){
if(root==NULL) return 0;
//if(root->left||root->right)
return 1+max(getDepth(root->left),getDepth(root->right));
//return 1;
}
};