2021/4/21 剑指 Offer 28. 对称的二叉树

递归太妙了

/**
 * 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:
    bool isSymmetric(TreeNode* root) {
        return isSymmetric(root,root);
    }
    bool isSymmetric(TreeNode* root1,TreeNode* root2){
        if(root1==nullptr&&root2==nullptr) return true;
        if(root1==nullptr||root2==nullptr) return false;
        if(root1->val!=root2->val) return false;
         return isSymmetric(root1->left,root2->right)&&isSymmetric(root2->left,root1->right);


        
    }
};