/**
* 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:
void reverse(TreeNode*&root)
{
if(root)
{
reverse(root->left);
reverse(root->right);
TreeNode*temp=root->left;
root->left=root->right;
root->right=temp;
}
}
TreeNode* mirrorTree(TreeNode* root)
{
reverse(root);
return root;
}
};
