LeetCode110.平衡二叉树

题目

class Solution {
public:
    bool isBalanced(TreeNode* root) {
        if(root == NULL) return true;
        return abs(height(root->left)-height(root->right)) <= 1 && isBalanced(root->left) && 
        isBalanced(root->right);
    }
    int height(TreeNode* root){
        if(root == NULL) return 0;
        return max(height(root->left),height(root->right)) + 1;
    }
};

一开始不会对每个结点进行高度判断，判断平衡的递归思想和镜像对称二叉树的那个题一个套路