剑指offer 27-二叉树的镜像 C++

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

思路１：非递归，使用队列进行每一层的反转

/*
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== nullptr)
            return;
        queue<TreeNode*> q;
        q.push(pRoot);
        TreeNode* tree = nullptr;
        while (!q.empty()){
            tree = q.front();
            q.pop();
            swap(tree->left,tree->right);  //注：交换节点元素，才能输出镜像二叉树，
            if(tree->right)
                q.push(tree->right);
            if(tree->left)
                q.push(tree->left);
        }
    }
};

思路２：递归

class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(pRoot== nullptr)
            return;
        swap(pRoot->left,pRoot->right);
        Mirror(pRoot->left);
        Mirror(pRoot->right);
    }
};