剑指offer-二叉树的镜像

问题

思路

代码

/*
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){

Mirror(pRoot->left);
Mirror(pRoot->right);
TreeNode* p = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = p;

}
return;
}
};