数据结构/PTA-据后序和中序遍历输出先序遍历/树

#include<bits/stdc++.h>
using namespace std;
typedef struct BiTNode
{
    struct BiTNode *lchild;
    struct BiTNode *rchild;
    int data;
} BiTNode, *BiTree;
BiTree Plustree(int *in,int *post,int n)
{
    if(n<=0)
        return NULL;
    else
    {
        BiTree T=new BiTNode;
        T->data=post[n-1];
        int i=0;
        for(i=0; i<n; i++)
        {
            if(post[n-1]==in[i])
                break;
        }
        T->lchild = Plustree(in, post, i);
        T->rchild = Plustree(in+i+1,post+i,n-i-1);
        return T;
    }
}
void preorderTraversal( BiTree BT )//前序遍历
{
      if(BT){
        cout << " " << BT->data;
        preorderTraversal(BT->lchild);
        preorderTraversal(BT->rchild);
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    int b[32],a[32];
    BiTree T;
    for(int i=0; i<n; i++)
        cin>>a[i];
    for(int i=0; i<n; i++)
        cin>>b[i];
    T=Plustree(b,a,n);

    printf("Preorder:");
    preorderTraversal(T);


}