剑指offer 二叉树的镜像

 1 /*
 2 struct TreeNode {
 3     int val;
 4     struct TreeNode *left;
 5     struct TreeNode *right;
 6     TreeNode(int x) :
 7             val(x), left(NULL), right(NULL) {
 8     }
 9 };*/
10 class Solution {
11 public:
12     void Mirror(TreeNode *pRoot) {
13         if(pRoot == NULL) return ;
14         else{
15             TreeNode *temp = new TreeNode(NULL);
16             temp = pRoot->left;
17             pRoot->left = pRoot->right;
18             pRoot->right = temp;
19             Mirror(pRoot->left);
20             Mirror(pRoot->right);
21         }
22     }
23 };