剑指offer 二叉树镜像

题目描述
操作给定的二叉树，将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义：源二叉树
8
/
6 10
/ \ /
5 7 9 11
镜像二叉树
8
/
10 6
/ \ /
11 9 7 5

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

//借助队列
class Solution {
public:
    void Mirror(TreeNode *pRoot) 
    {
        if (NULL == pRoot)
            return;
        queue<TreeNode *> que;
        que.push(pRoot);
        while (!que.empty())
        {
            TreeNode *tmp_top = que.front();
            que.pop();
            
            TreeNode * tmp = tmp_top->left;
            tmp_top->left = tmp_top->right;
            tmp_top->right = tmp;
            if (NULL != tmp_top->left)
                que.push(tmp_top->left);
            if (NULL != tmp_top->right)
                que.push(tmp_top->right);
        }
    }
};