代码随想录day15

### 226
```C++
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void InorderReverse(TreeNode* root){
        if(root==nullptr){
            return ;
        }
        swap(root->left,root->right);
        InorderReverse(root->left);
        InorderReverse(root->right);
    }
    TreeNode* invertTree(TreeNode* root) {
        InorderReverse(root);
        return root;

    }
};
```
### 101
```C++
class Solution {
public:
    bool compare(TreeNode* left,TreeNode* right){
        if(left==nullptr&&right!=nullptr) return false;
        else if(left!=nullptr&&right==nullptr) return false;
        else if(left==nullptr&&right==nullptr) return true;
        else if(left->val!=right->val) return false;
        bool outside=compare(left->left,right->right);
        bool inside=compare(left->right,right->left);
        bool res=outside&&inside;
        return res;
        
    }
    bool isSymmetric(TreeNode* root) {
        if(root==nullptr){
            return true;
        }
        bool res=compare(root->left,root->right);
        return res;


    }
};
```

层序太多就不写了