#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          using namespace std;//更新于2017.9.10int n,s;vector
          
            ino,pos;vector
           
            
             > lev; void build(int posL,int posR,int inoL,int inoR,int dep){ if(posL>posR) return; int e=pos[posR],idx=inoR,pdx=posR; while(idx>=inoL&&e!=ino[idx]) idx--,pdx--; if(dep+1>lev.size()) lev.resize(dep+1); lev[dep].push_back(e); build(posL,pdx-1,inoL,idx-1,dep+1); build(pdx,posR-1,idx+1,inoR,dep+1);}int main(){ cin>>n; ino.resize(n); pos.resize(n); for(int i=0;i
             
              >pos[i]; for(int i=0;i
              
               >ino[i]; build(0,n-1,0,n-1,0); for(auto xv:lev) { for(auto x:xv) ++s==n?cout<
               
                <
                
                 <<" "; } return 0;}
                
               
              
             
            
           
          
         
        
       
      
     

以前的AC代码

#include 
     
      #include 
      
       typedef struct BinNode{    struct BinNode *lchild,*rchild;    int e;}BinTree;void PostAndInToPre(int *postorder,int *inorder,int lenth,BinTree **T){    if(lenth==0)    {        *T=NULL;        return;    }    *T=(BinTree *)malloc(sizeof(BinTree));    (*T)->e=*(postorder+lenth-1);    int rootindex=lenth-1;    while(postorder[lenth-1]!=inorder[rootindex]&&rootindex>=0)        rootindex--;    PostAndInToPre(postorder,inorder,rootindex,&(*T)->lchild);//left    PostAndInToPre(postorder+rootindex,inorder+rootindex+1,lenth-rootindex-1,&(*T)->rchild);//right    return;}int LeverOrderTraversal(BinTree *T,int a[]){    BinTree *BT;    BinTree *quene[100];    int front=0,rear=0,n=0;    quene[rear++]=T;    while(front!=rear)    {        BT=quene[front++];        a[n++]=BT->e;        if(BT->lchild)            quene[rear++]=BT->lchild;        if(BT->rchild)            quene[rear++]=BT->rchild;    }    return n;}int main(){    int *post,*in;    int n,i;    scanf("%d",&n);    post=(int *)malloc(n*sizeof(int));    in=(int *)malloc(n*sizeof(int));    for(i=0;i