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 of every node never differ by more than 1.

解答：

/**
 * 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 isBalancedWithDepth(TreeNode* root, int& depth) {
        if (!root) {
            depth = 0;
            return true;
        }

        int lDepth;
        bool lTreeBalanced = isBalancedWithDepth(root->left, lDepth);
        int rDepth;
        bool rTreeBalanced = isBalancedWithDepth(root->right, rDepth);

        if (lTreeBalanced && rTreeBalanced) {
            int dis = abs(lDepth - rDepth);
            if (dis <= 1) {
                depth = 1 + (lDepth > rDepth ? lDepth : rDepth);
                return true;
            }
        }

        return false;
    }

    bool isBalanced(TreeNode* root) {
        int depth;
        return isBalancedWithDepth(root, depth);
    }
};