leetcode每日一题第七十三天

class Solution {
public:

    bool check(TreeNode *p,TreeNode*q)
    {
        if(!p && !q) return true;
        if(!p || !q) return false;
        return p->val == q->val && check(p->left, q->right) && check(p->right, q->left);
    }

    bool checkSymmetricTree(TreeNode* root) {
        return check(root,root);
    }

};