#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
vector<int> post,in,level;
int n;
struct node{
int data;
node* lchild;
node* rchild;
};
node* create(int postL,int postR,int inL,int inR){
if(postL>postR) return NULL;
node* root= new node;
int k;
for(k=inL;k<=inR;k++){
if(in[k]==post[postR]) break;
}
int numleft=k-inL;
root->data=in[k];
root->lchild=create(postL,postL+numleft-1,inL,k-1);
root->rchild=create(postL+numleft,postR-1,k+1,inR);
return root;
}
void leveltrvl(node* root){
queue<node*> q;
q.push(root);
node* Node=new node;
while(!q.empty()){
Node=q.front();
level.push_back(Node->data);
q.pop();
if(Node->lchild!=NULL) q.push(Node->lchild);
if(Node->rchild!=NULL) q.push(Node->rchild);
}
}
int main(){
int i;
scanf("%d",&n);
int temp;
for(i=0;i<n;i++){
scanf("%d",&temp);
post.push_back(temp);
}
for(i=0;i<n;i++){
scanf("%d",&temp);
in.push_back(temp);
}
node* root=create(0,n-1,0,n-1);
leveltrvl(root);
for(i=0;i<n;i++){
if(i<n-1) printf("%d ",level[i]);
else printf("%d\n",level[i]);
}
system("pause");
return 0;
}
PAT A1020 tree traversals (25)
最新推荐文章于 2018-08-03 21:06:43 发布