题目:
思路:
左边到右边,右边到左边
有点类似于swap了 过于easy
代码是:
class Solution {
public:
TreeNode* tem;
void change(TreeNode* root){
if(root!=nullptr){
tem=root->right;
root->right=root->left;
root->left=tem;
change(root->left);
change(root->right);
}
}
TreeNode* invertTree(TreeNode* root) {
change(root);
return root;
}
};