http://acm.hdu.edu.cn/showproblem.php?pid=1710
题意:给你一个二叉树的前序和中序序列,求后序序列。
思路:主要精力应放在建树上。我的思路为前序序列的第一个元素即为当前根,这个根将中序序列拆分成左右子树,拆分成的左右子树再映射到前序序列中,找出下一次递归对应的下标,然后不断拆分前序序列和中序序列。
这里由于是数组,所以使用了相对距离这一概念。
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <climits>
using namespace std;
const int MAXN = 1005;
const int INF = INT_MAX;
struct Treenode{
int data;
Treenode* leftchild;
Treenode* rightchild;
Treenode(int d) : data(d), leftchild(NULL), rightchild(NULL) {}
};
int preorder[MAXN], inorder[MAXN];
bool flag;
//start起点元素元素,end终点元素下一位置,pos为分界点
Treenode* Build(int prestart, int preend, int instart, int inend){
if(prestart > preend || instart > inend){
return NULL;
}
int d = preorder[prestart], pos;
//printf("%d [%d, %d], [%d, %d]\n", d, prestart, preend, instart, inend);
Treenode* root = new Treenode(d);
for(int i = instart; i <= inend; i++){
if(inorder[i] == d){
pos = i;
break;
}
}
int interval = pos - instart;//相对距离
root->leftchild = Build(prestart + 1, prestart + interval, instart, instart + interval - 1);
root->rightchild = Build(prestart + interval + 1, preend, instart + interval + 1, inend);
return root;
}
void PostOrder(Treenode* root, bool &flag){
if(root == NULL) return;
PostOrder(root->leftchild, flag);
PostOrder(root->rightchild, flag);
if(flag) printf(" ");
flag = true;
printf("%d", root->data);
return;
}
int main(){
//freopen("in.txt", "r", stdin);
int n;
while(~scanf("%d", &n)){
for(int i = 0; i < n; i++){
scanf("%d", &preorder[i]);
}
for(int i = 0; i < n; i++){
scanf("%d", &inorder[i]);
}
Treenode* root = Build(0, n - 1, 0, n - 1);
flag = false;
PostOrder(root, flag);
printf("\n");
}
return 0;
}