LeetCode:Balanced Binary Tree

题目

Balanced Binary Tree

• 平衡二叉树：左右子树高度相差不超过1
• 判断是否是平衡二叉树

C++代码

/**
 * 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:
    int getDepth(TreeNode* root){
        if(root==NULL){
            return 0;
        }else{
            int left_depth=getDepth(root->left);
            int right_depth=getDepth(root->right);
            return left_depth>right_depth?left_depth+1:right_depth+1;
        }
    }
    bool isBalanced(TreeNode* root) {
        if(root==NULL){
            return true;
        }
        int left_depth = getDepth(root->left);
        int right_depth = getDepth(root->right);
        if(abs(left_depth-right_depth)>1){
            return false;
        }else{//除了要满足左右子树高度差不超过1，还要保证左右子树都是平衡二叉树
            return isBalanced(root->left)&&isBalanced(root->right);
        }
    }
};