后序的最后一个是根结点,令i在中序中找到该根结点,则i把中序分为两部分,左边是左子树,右边是右子树。因为是输出先序(根左右),所以先打印出当前根结点,然后打印左子树,再打印右子树。左子树在后序中的根结点为root – (end – i + 1),即为当前根结点-(右子树的个数+1)。左子树在中序中的起始点start为start,末尾end点为i – 1.右子树的根结点为当前根结点的前一个结点root – 1,右子树的起始点start为i+1,末尾end点为end。
-----------求后序遍历类似----------
》代码如下:
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 35;
int n, post[maxn], in[maxn];
vector<pair<int, int>> ans;
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first < b.first;
}
void pre(int root, int start, int end, int index) { // 该函数是整个算法的核心
if(start > end) return ;
int i = start;
while(i < end && in[i] != post[root]) i++;
ans.push_back(make_pair(index, post[root]));
pre(root - 1 - end + i, start, i - 1, 2 * index + 1);
pre(root - 1, i + 1, end, 2 * index + 2);
}
int main() {
cin >> n;
for(int i = 0; i < n; i++) cin >> post[i];
for(int i = 0; i < n; i++) cin >> in[i];
pre(n - 1, 0, n - 1, 0);
sort(ans.begin(), ans.end(), cmp);
cout << ans[0].second;
for(int i = 1; i < ans.size(); i++)
cout << " " << ans[i].second;
return 0;
}
常规思路—重建二叉树,代码如下:
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 35;
int n, pre[maxn], in[maxn], post[maxn];
struct Node{
int data;
Node *lchild, *rchild;
};
Node* create(int postL, int postR, int inL, int inR) {
if(postL > postR) return NULL;
Node* root = new Node;
root -> data = post[postR];
int start = inL;
while(in[start] != post[postR]) start ++;
int numRight = inR - start;
root -> lchild = create(postL, postR - 1 - numRight, inL, start - 1);
root -> rchild = create(postR - numRight, postR - 1, start + 1, inR);
return root;
}
int num = 0;
void BFS(Node* root){
queue<Node*> q;
q.push(root);
while(!q.empty()) {
Node* root = q.front();
q.pop();
if(num++) cout << " ";
cout << root -> data;
if(root -> lchild) q.push(root -> lchild);
if(root -> rchild) q.push(root -> rchild);
}
}
int main() {
cin >> n;
for(int i = 0; i < n; i++) cin >> post[i];
for(int i = 0; i < n; i++) cin >> in[i];
Node* root = create(0, n - 1, 0, n - 1);
BFS(root);
return 0;
}