传送门
已知前序,并且因为二叉搜索树的特性,中序也确定,只需判断能不能建树,能就输出后序
思路类似于1027,多了一个镜像树的过程
版本一 好写版
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 0x3f3f3f3f
using namespace std;
const int N=1e5+5;
int n,m,k;
int in[N],pre[N],post[N];
unordered_map<int,int>pos,l,r;
int cnt;
bool build(int il,int ir,int pl,int pr,int type){
if(il>ir) return true;
int root=pre[pl];
int k;
if(type==0){
k=il;
while(in[k]!=root&&k<=ir)k++;
}
else{
k=ir;
while(in[k]!=root&&k>=il)k--;
}
//int k=pos[root];
if(k<il||k>ir){
return false;
}
bool res=true;
if(!build(il,k-1,pl+1,pl+1+k-1-il,type)) res=false;
if(!build(k+1,ir,pl+1+k-1-il+1,pr,type)) res=false;
post[cnt++]=root;
return res;
}
int main(){
cin>>n;
rep(i,0,n){
cin>>pre[i];
in[i]=pre[i];
}
sort(in,in+n);
//rep(i,0,n) pos[in[i]]=i;
if(build(0,n-1,0,n-1,0)){
puts("YES");
rep(i,0,n)
printf("%d%c",post[i],i==n-1?'\n':' ');
}
else{
reverse(in,in+n);
//rep(i,0,n) pos[in[i]]=i;
cnt=0;
if(build(0,n-1,0,n-1,1)){
puts("YES");
rep(i,0,n)
printf("%d%c",post[i],i==n-1?'\n':' ');
}
else {
puts("NO");
}
}
}
版本二,老老实实建树版,不推荐
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define sca(x) scanf("%d",&x)
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e5+5;
vector<int>v,pre,preM,post,postM;
struct node{
int data;
node*l,*r;
};
void insert1(node*&root,int data){
if(root==NULL){
root=new node;
root->data=data;
root->l=root->r=NULL;
return;
}
if(data<root->data) insert1(root->l,data);
else insert1(root->r,data);
}
void insert2(node*&root,int data){
if(root==NULL){
root=new node;
root->data=data;
root->l=root->r=NULL;
return;
}
if(data<root->data) insert2(root->r,data);
else insert2(root->l,data);
}
void preOrder(node *root,vector<int>&vi){
if(root==NULL)return;
vi.push_back(root->data);
preOrder(root->l,vi);
preOrder(root->r,vi);
}
void postOrder(node *root,vector<int>&vi){
if(root==NULL)return;
postOrder(root->l,vi);
postOrder(root->r,vi);
vi.push_back(root->data);
}
int main(){
int n,data;
node*root=NULL,*rootM=NULL;
sca(n);
rep(i,0,n){
sca(data);
v.push_back(data);
insert1(root,data);
insert2(rootM,data);
}
preOrder(root,pre);
preOrder(rootM,preM);
postOrder(root,post);
postOrder(rootM,postM);
if(v==pre){
puts("YES");
rep(i,0,post.size()){
printf("%d%c",post[i],i==post.size()-1?'\n':' ');
}
}
else if(v==preM){
puts("YES");
rep(i,0,postM.size()){
printf("%d%c",postM[i],i==postM.size()-1?'\n':' ');
}
}
else puts("NO");
return 0;
}