二叉树镜像（递归）

递归的去调换每个节点的左孩子和右孩子。

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