【剑指Offer27-二叉树的镜像（C++附带测试）】

这题有点意思，因为想明白一点就好了：

为了得到镜像的树，实际上就是对每一个节点交换左右子树。

那么我们为了方便递归，从底层开始，因为这样才能得到一个正确的交换结果。

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
struct TreeNode{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x):val(x),left(NULL),right(NULL){}
};


class Solution {
public:
    TreeNode* mirrorTree(TreeNode* root) {
    	if(root==nullptr){
    		return nullptr;
		}
        root->left = mirrorTree(root->left);
        root->right = mirrorTree(root->right);
        
        TreeNode* temp = root->left;
        root->left = root->right;
        root->right = temp;
        
        return root;
    }
};

TreeNode* create(vector<int> a,int i){
	if(a[i]==-1){
		return nullptr;
	}
	
	TreeNode* root = new TreeNode(a[i]);
	int left = i*2+1;
	int right = i*2+2;
	
	if(left>a.size()-1){
		root->left = nullptr;
	}else{
		root->left = create(a,left);
	}
	
	if(right>a.size()-1){
		root->right = nullptr;
	}else{
		root->right = create(a,right);
	}
	
	return root;
} 

void preorder(TreeNode* root){
	if(root==nullptr){
		return;
	}
	cout<<root->val<<" ";
	preorder(root->left);
	preorder(root->right);
}



int main(){
	vector<int> Tree1{4,2,7,1,3,6,9};
	TreeNode* Treehead1 = create(Tree1,0);
	preorder(Treehead1);
	cout<<endl;
	Solution solution;
	Treehead1 = solution.mirrorTree(Treehead1);
	preorder(Treehead1);
}