二叉树的镜像

 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)
14                 return ;
15             if (pRoot->left != NULL)
16                 Mirror(pRoot->left);
17             if (pRoot->right != NULL)
18                 Mirror(pRoot->right);
19             TreeNode *ptem = pRoot->left;
20             pRoot->left = pRoot->right;
21             pRoot->right = ptem;
22     }
23 };