剑指offer 二叉树的镜像

操作给定的二叉树，将其变换为源二叉树的镜像

思路：递归，从上到下，交换即可。

class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(pRoot == NULL)
            return;
		TreeNode *left,*right;
        left = pRoot->right;
        right = pRoot->left;
        pRoot ->left = left;
        pRoot ->right = right;
        Mirror(pRoot->right);
        Mirror(pRoot->left);
    }
};