leetcode226. 翻转二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
    if(root == nullptr) return root;
    TreeNode* root_right = root->right;//deal with heap use after free,temp值
    root->right = invertTree(root->left);
    root->left = invertTree(root_right);
    return root;
    }
};

#include <stdio.h>
#include <algorithm>
#include<vector>
#include<queue>
#include<iostream>
#include<memory>
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) {}
};
//使用数组建立二叉树
TreeNode *CreateBiTree(vector<int> &a, int n, int start)//*a为data，n为数组长度，start为根节点
{
	if (a[start] == -1)return nullptr;//当根节点为空，即空树

	TreeNode* root = new TreeNode(a[start]);//新建一个根结点
	//给根结点root的成员变量data,lchild,rchild赋初值
	root->left = nullptr;
	root->right = nullptr;

	int lnode = 2 * start + 1;//用根节点确定左节点的位置
	int rnode = 2 * start + 2;//用根节点确定右节点的位置

	if (lnode > n - 1) root->left = nullptr;//超出范围为孔
	else root->left = CreateBiTree(a, n, lnode);//lnode替换start，为左子树的根节点

	if (rnode > n - 1) root->right = nullptr;
	else root->right = CreateBiTree(a, n, rnode);//rnode替换start，为右子树的根节点

	return root;
}


void out_tree(TreeNode *head){
    if(head!= nullptr){
        cout<< head->val;
        out_tree(head->left);
        out_tree(head->right);
    }
}




class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
    if(root == nullptr) return root;
    TreeNode* root_right = root->right;//deal with heap use after free
    root->right = invertTree(root->left);
    root->left = invertTree(root_right);
    return root;
    }
};



int main()
{
    //Solution *myslo = new Solution();
    unique_ptr<Solution> myslo = unique_ptr<Solution>(new Solution());
    vector<int> v1 = {1,2,3}; 
    TreeNode *tree = CreateBiTree(v1,v1.size(),0);
    out_tree(tree); // 123
    TreeNode *res = myslo->invertTree(tree);
    out_tree(res); //132
    cout<<"*************************************************************"<<endl;
    //delete myslo;
    return 0;
}