每日一题-判断是否为平衡二叉树

题目：给定一个二叉树，判断它是否是 平衡二叉树

解答：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
//求高度函数
int getHeight(struct TreeNode* root)
{
    if(root==NULL)
        return 0;
    else
        return fmax(getHeight(root->left),getHeight(root->right))+1;
}
bool isBalanced(struct TreeNode* root) {
    if(root==NULL)
        return true;
    //平衡二叉树条件：左右节点高度差的绝对值小于1&&左子树是一颗平衡二叉树&&右子树是一颗平衡二叉树
    return (abs(getHeight(root->left)-getHeight(root->right))<=1)&&isBalanced(root->left)&&isBalanced(root->right);
}