PAT A1020 tree traversals (25)
来源:互联网 发布:mac镜像文件iso下载 编辑:程序博客网 时间:2024/06/07 07:13
#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;
}
#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;
}
0 0
- PAT A1020 tree traversals (25)
- 【PAT】A1020. Tree Traversals (25)
- PAT A1020. Tree Traversals (25)
- PAT A1020. Tree Traversals
- PAT [A1020]-Tree Traversals
- PAT甲级练习题A1020. Tree Traversals (25)
- A1020. Tree Traversals (25)
- PAT A1020 Tree Traversals 根据先序和中序求层序
- PAT A1086 tree traversals again(25)
- pat 1020. Tree Traversals (25)
- 【PAT】1020. Tree Traversals (25)
- PAT 1020 Tree Traversals (25)
- PAT: 1020. Tree Traversals (25)
- PAT 1020. Tree Traversals(25)
- 【PAT】1020. Tree Traversals (25)
- [PAT]1020. Tree Traversals (25)
- PAT 1020. Tree Traversals (25)
- PAT 1020. Tree Traversals (25)
- 吐槽一下Thinking In Java中文版翻译
- Java反射机制
- 欢迎使用CSDN-markdown编辑器
- java web项目在双机下的定时任务
- 录音播放系统(实现pcm转码mp3,wav)
- PAT A1020 tree traversals (25)
- 【书山有路】Python基础教程 第5章
- 461. Hamming Distance
- 奶牛生子问题(腾讯面试题)
- Ext.js 常用组件(Ext.Button、、、)
- Volley框架(二):使用Volley加载图片
- Git小抄
- java中的匿名内部类总结
- CentOS7 vsftpd快速实现文件上传(非匿名)