18. 二叉树的镜像.cpp

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

/*
思路：递归
*/

/*
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 || (pRoot->left == NULL && pRoot->right == NULL))
			return;
		
		TreeNode *tmp = pRoot->left;
		pRoot->left = pRoot->right;
		pRoot->right = tmp;
		if (pRoot->left != NULL)
		{
			Mirror(pRoot->left);
		}
		
		if (pRoot->right != NULL)
		{
			Mirror(pRoot->right);
		}
    }
};