题目链接/文章讲解/视频讲解：https://programmercarl.com/0110.%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.html

1.和昨天的最大二叉树高度，最小深度，是一个类型的题，今天还是一刷完成递归。

CPP

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int getMax(TreeNode *node){
        if(node == NULL) return 0;
        int leftHeight = getMax(node->left);
        int rightHeight = getMax(node->right);
        if(leftHeight == -1) return -1;
        if(rightHeight == -1) return -1;
        if(abs(leftHeight - rightHeight) > 1){
            return -1;
        }else{
            return 1 + max(leftHeight , rightHeight); 
        }
        

    }
    bool isBalanced(TreeNode* root) {

        return getMax(root) == -1?false:true;
    }
};