C++版 - 剑指offer 面试题19：二叉树的镜像(leetcode226. Invert Binary Tree) 题解

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

    }
};