二叉树的oj题

struct TreeNode* invertTree(struct TreeNode* root) {
    if(root==NULL)
    return NULL;
    struct TreeNode *left=invertTree(root->left);
    struct TreeNode *right=invertTree(root->right);
    root->left=right;
    root->right=left;
    return root;
}

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 int height(struct TreeNode* root)
 {
    if(root==NULL)
    {
        return 0;
    }
    else
    return fmax(height(root->left),height(root->left))+1;
 }
bool isBalanced(struct TreeNode* root) {
    if(root==NULL)
    return true;
    else 
    return fabs(height(root->left)-height(root->right))<=1&&isBalanced(root->left)&&isBalanced(root->right);
}