剑指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){
swap(pRoot->left,pRoot->right);
if(pRoot->left){
if(pRoot->left->left||pRoot->left->right)
Mirror(pRoot->left);
}
if(pRoot->right){
if(pRoot->right->left||pRoot->right->right)
Mirror(pRoot->right);
}
}
}
};