[牛客网]二叉树的镜像

题目：

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

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;
        if(pRoot->left != NULL) Mirror(pRoot->left);
        if(pRoot->right != NULL) Mirror(pRoot->right);
        if(pRoot->left != NULL && pRoot->right == NULL) {
                pRoot->right = pRoot->left;
                pRoot->left = NULL;
        } else if(pRoot->left == NULL && pRoot->right != NULL) {
                pRoot->left = pRoot->right;
                pRoot->right = NULL;

        } else {
                TreeNode *tmp = NULL;
                tmp = pRoot->left;
                pRoot->left = pRoot->right;
                pRoot->right = tmp;
        }
    }
};