[LeetCode] 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 ofevery node never
differ by more than 1.

/**
* Definition for binary tree
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int height=0;
return mRoutine(root,height);
}

bool mRoutine(TreeNode *root, int &height)
{
if(root==NULL)
{
height=0;
return true;
}

int lHeight=0;
int rHeight=0;
if(!mRoutine(root->left,lHeight) || !mRoutine(root->right,rHeight))
return false;

if(lHeight-rHeight>1 || rHeight-lHeight>1)
return false;

if(lHeight>rHeight)
height=lHeight+1;
else
height=rHeight+1;

return true;
}
};