根据题意,应该先镜像子树再向上镜像,所以就是一个后续遍历
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if(pRoot==NULL) return;
Mirror(pRoot->left);
Mirror(pRoot->right);
TreeNode * tmp=pRoot->left;
pRoot->left=pRoot->right;
pRoot->right=tmp;
return;
}
};