[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 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) {
        if(root == NULL) {
            return true;
        }
        return isBalanced(root->left) && isBalanced(root->right) && abs(getDepth(root->left) - getDepth(root->right)) <= 1;
    }
    
    int getDepth(TreeNode *root) {
        if(root == NULL) {
            return 0;
        }
        return 1 + max(getDepth(root -> left), getDepth(root -> right));
    }
};

思路：按照平衡二叉树的定义：左右孩子必须都是平衡二叉树，并且左右孩子的深度最多相差1.