二叉树的镜像

二叉树的镜像_牛客题霸_牛客网

题目描述

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

输入描述:

二叉树的镜像定义：源二叉树 
    	    8
    	   /  \
    	  6   10
    	 / \  / \
    	5  7 9 11
    	镜像二叉树
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7  5

class Solution {
public:
    TreeNode* Mirror(TreeNode* pRoot) {
        postorder(pRoot);
        return pRoot;
    }
private:
    void postorder(TreeNode* node) {
        if (node == nullptr) {
            return;
        }
        postorder(node->left);
        postorder(node->right);
        TreeNode* tmpNode = node->left;
        node->left = node->right;
        node->right = tmpNode;
    }
};

 

/*
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()){
            pRoot=q.front();
            q.pop();          
            if(pRoot){
                q.push(pRoot->right);
                q.push(pRoot->left);
                
                if(pRoot->left || pRoot->right){
                    TreeNode *temp=pRoot->right;
                    pRoot->right=pRoot->left;
                    pRoot->left=temp;
                }
            }        
        }
    }
};