[剑指offer]面试题19：二叉树的镜像

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

用递归来写，超简洁。

/*
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;
        swap(pRoot->left, pRoot->right);
        Mirror(pRoot->left);
        Mirror(pRoot->right);
    }
};

用栈来写，也挺简单。

/*
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;
        queue<TreeNode*> q;
        q.push(pRoot);
        while(!q.empty()){
            TreeNode* pCur = q.front();
            q.pop();
            swap(pCur->left, pCur->right);
            if(pCur->left)
                q.push(pCur->left);
            if(pCur->right)
                q.push(pCur->right);
        }
    }
};