判断对称二叉树（力扣145题）

 

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool check(struct TreeNode *root1,struct TreeNode *root2)
{
    if(root1==NULL&&root2==NULL)
    return true;
    if(root1==NULL||root2==NULL)
    return false;
    if(root1->val!=root2->val)
    return false;
    return check(root1->left,root2->right)&&check(root1->right,root2->left);
}
bool checkSymmetricTree(struct TreeNode* root) {
    if(root==NULL)
    return true;
    return check(root->left,root->right);
}