前序遍历+后序遍历 确定中序遍历(不一定唯一)
用前序遍历的下一个根结点在后续遍历中查找所在位置确定子树节点个数,两个节点之间的节点数即为子树节点数,然后子树根结点是子树前序遍历起始位置。
由先序遍历 根左右 (根和子根好确定)的性质推知需要在后序遍历中查找子树节点数
#include<bits/stdc++.h>
using namespace std;
const int maxn = 35;
int pre[maxn], post[maxn];
bool flag = true;
vector<int>v;
void inorder(int prel, int prer, int postl, int postr) {//树前序起止位置 后续起止位置
if (prel == prer) {
v.push_back(pre[prel]);
return;
}
int nextpr = pre[prel + 1];//下一个根结点
int nxtpoi = postl;
while(post[nxtpoi] != nextpr && nxtpoi <= postr)
nxtpoi++;
int num = nxtpoi - postl; //以nextpr为根节点的子树的节点数(由后序遍历的 起始位置-根结点所在位置确定 -- 左右根)
if (prer - prel - 1 == num)//即prel-prer范围内除了prel为根结点,其余都在prel的一个子树上
flag = false;
inorder(prel + 1, prel + num + 1, postl, nxtpoi);//遍历左子树
v.push_back(pre[prel]);
if (prer - prel - 1> num)
inorder(prel + num + 2, prer, nxtpoi + 1, postr - 1);//遍历右子树
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &pre[i]);
for (int i = 0; i < n; i++)
scanf("%d", &post[i]);
inorder(0, n - 1, 0, n - 1);
if(flag)printf("Yes\n");
else printf("No\n");
printf("%d", v[0]);
for (int i = 1; i < n; i++)
printf(" %d", v[i]);
printf("\n");
}
24分有漏洞代码:
有漏洞的解法:即在前序遍历中找寻后序遍历根节点位置,然后左边查询 右边查询,根结点则是后序遍历节点的顺序从后往前.......然后 就有两个例子答案错误
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;
const int N =30+5;
int pre[N], pos[N];
int n;
vector<int> in;
stack<int> post;
struct Node {
Node *l, *r;
int data;
Node() {
l = r = NULL;
}
}*root;
bool flag = true;
void CreateT(Node* &root, int l, int r) {
if(l >= r) {
if(l == r) in.push_back(pre[l]);
return;
}
//cout << l << "dao" << r << endl; cout << "寻求" <<post.top() << endl;
int lr = l;
for(int i=l+1; i<=r; i++) {
if (pre[l+1] == post.top()) {
// cout << post.top() << l+1 << endl;
flag = false;
}
if(pre[i] == post.top()) {
// cout <<"所到边界"<< i-1 << endl;
lr = i-1;
post.pop();
break;
}
}
if(root == NULL) {
// cout <<l << "==="<< pre[l] << endl;
root = new Node;
root->data = pre[l];
}
// cout << "此刻将" << l << "-" << r<< "划分为 " << l+1<< "-" << lr << "和"<< lr+1 << "-" << r << endl;
if(l+1 < lr)post.pop();//注意存在左子树且节点数大于1时,需要pop post末尾的根结点,不然会出错
CreateT(root->l, l+1, lr);
// cout<< "push进" << pre[l] << endl;;
in.push_back(pre[l]);
CreateT(root->r, lr+1, r);
}
int main() {
cin >> n;
for(int i=0; i<n; i++) {
cin >> pre[i];
}
for(int i=0; i<n; i++) {
int tmp;
cin >> tmp;
pos[i] = tmp;
post.push(tmp);
}
root = NULL;
post.pop();
CreateT(root, 0, n-1);
printf("%s\n", flag?"Yes":"No");
int i;
for(i=0; i<in.size()-1; i++) {
cout << in[i] << " ";
}
cout << in[i] << endl;
return 0;
}