剑指offer 编程题（17）：二叉树的镜像

题目描述

/*
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;
}
TreeNode *tem = NULL;
tem = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = tem;
Mirror(pRoot->left);
Mirror(pRoot->right);

}
};

class Solution {
public:
void Mirror(TreeNode *p) {
if(p){
swap(p -> left, p -> right);
Mirror(p -> left);
Mirror(p -> right);
}
}
};