剑指 Offer 27. 二叉树的镜像

题目

请完成一个函数，输入一个二叉树，该函数输出它的镜像。

思路

就是交换每个节点的左右节点的指针指向。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* mirrorTree(TreeNode* root) {
        TreeNode* cur = root;
        queue<TreeNode*> q;
        q.push(cur);
        while(!q.empty()){
            cur = q.front();
            q.pop();
            if(cur != NULL){
                q.push(cur->left);
                q.push(cur->right);
                TreeNode * tmp = cur->left;
                cur->left = cur->right;
                cur->right = tmp;
            }
        } 
        return root;
    }
};