前序中序，后续中序求树

#incldue<bits/stdc++.h>
using namespace std;
struct node {
int date;
node * left;
node * right;
};
strutc node * tree;
int a[10005],b[10005];
tree bintree(int prel,int prer,int inl,int inr)
{
if(prel>prer)
{
return NULL;
}
tree root=new node;
root->date[0]=a[prel];
int k;
for(k=inl;b[k]!=a[prel];k++);
int y=k-inl;
root->left=bintree(prel+1,prel+y,inl,k-1);
root->right=bintree(prel+y+1,prer,k+1,inr);
return root;
}
tree bintree(int postl,int postr,int inl,int inr)
{
if(postl>postr)
{
return NULL;
}
tree root=new node;
root->date[0]=a[postr];
int k;
for(k=inl;b[k]!=a[postr];k++);
int y=k-inl;
root->left=bintree(postl,post+y-1,inl,k-1);
root->right=bintree(postl+y,postr-1,k+1,inr);
return root;
}