由前序遍历与中序遍历生成二叉树及二叉树的前序，中序，后续，层序遍历

#include<iostream>
#include<cstdlib>
#include<string>
#include<vector>
#include<queue>
using namespace std;
typedef struct node
{
char data;
node* left;
node* right;
}node;
void create_btree(node*& one_node,const char* pre,const char* in,int len)
{
if (len<=0||pre==NULL||in==NULL)
{
return;
}
else
{
one_node=(node*)malloc(sizeof(node));
one_node->data = pre[0];
one_node->left = NULL;
one_node->right = NULL;
int temp = 0;
while (in[temp] != pre[0])
{
temp++;
}
create_btree(one_node->left, ++pre,in, temp);//由子树数据建立子树,注意此处对于pre实参的修改，先改变再引用，下一句需要先改回来再引用
create_btree(one_node->right, --pre + temp + 1, in + temp + 1, len-temp-1);
}
}


void pre_tree(node* tree)
{
if (tree != NULL)
{
cout << tree->data << endl;;
pre_tree(tree->left);
pre_tree(tree->right);
}
else
return;
}
void in_tree(node* tree)
{
if (tree != NULL)
{
in_tree(tree->left);
cout << tree->data<<' ';
in_tree(tree->right);
}
else
return;
}
void after_tree(node* tree)
{
if (tree != NULL)
{
after_tree(tree->left);
after_tree(tree->right);
cout << tree->data << " ";
}
else
return;
}
void cxbb(node* tree)
{
queue<node*> q;
q.push(tree);
while (!q.empty())
{
cout << q.front()->data<<' ';
if (q.front()->left!=NULL)
q.push(q.front()->left);
if (q.front()->right != NULL)
q.push(q.front()->right);
q.pop();
}


}
int main()
{
string pre;
string in;
node* tree = NULL;


cout << "input pre_order" << endl;
cin >> pre;
cout << "input in_order" << endl;
cin >> in;
const char* prec = pre.c_str();
const char* inc = in.c_str();
int len = pre.length();
int start = 0;
int end = start + len-1;
create_btree(tree,prec,inc,len);
pre_tree(tree);
cout << endl;
in_tree(tree);
cout << endl;
after_tree(tree);
cout << endl;
cxbb(tree);
return 0;
}