根据先序遍历和中序遍历建立二叉树

#include<iostream>
#include<cstdlib>
#include<string>
#include<vector>
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);
}
}
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);
return 0;
}