面试题19：二叉树的镜像

链接： https://www.nowcoder.com/questionTerminal/564f4c26aa584921bc75623e48ca3011
来源：牛客网

/*

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);

     }

}