https://pintia.cn/problem-sets/994805342720868352/problems/994805485033603072
题意:给出中序后序求层序。
思路:同hdu1710,只不过这次是根据后序序列拆分中序序列。我的思路为后序序列的最后一个元素即为当前根,这个根将中序序列拆分成左右子树,拆分成的左右子树再映射到前序序列中,找出下一次递归对应的下标,然后不断拆分后序序列和中序序列。
#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 = 35;
const int INF = INT_MAX;
struct Treenode{
int data;
Treenode* leftchild;
Treenode* rightchild;
Treenode(int d) : data(d), leftchild(NULL), rightchild(NULL) {}
};
int postorder[MAXN], inorder[MAXN];
Treenode* Build(int poststart, int postend, int instart, int inend){
if(poststart > postend || instart > inend) return NULL;
int d = postorder[postend];
Treenode* root = new Treenode(d);
int pos;
for(int i = instart; i <= inend; i++){
if(inorder[i] == d){
pos = i;
break;
}
}
int interval = pos - instart;
root->leftchild = Build(poststart, poststart + interval - 1, instart, instart + interval - 1);
root->rightchild = Build(poststart + interval, postend - 1, instart + interval + 1, inend);
return root;
}
void LevelOrder(Treenode* root){
if(root == NULL) return;
queue<Treenode*> myqueue;
myqueue.push(root);
bool flag = false;
while(!myqueue.empty()){
Treenode* current = myqueue.front();
myqueue.pop();
if(flag) printf(" ");
flag = true;
printf("%d", current->data);
if(current->leftchild != NULL) myqueue.push(current->leftchild);
if(current->rightchild != NULL) myqueue.push(current->rightchild);
}
}
int main(){
// freopen("in.txt", "r", stdin);
int n;
while(~scanf("%d", &n)){
for(int i = 0; i < n; i++){
scanf("%d", &postorder[i]);
}
for(int i = 0; i < n; i++){
scanf("%d", &inorder[i]);
}
Treenode* root = Build(0, n-1, 0, n-1);
LevelOrder(root);
printf("\n");
}
return 0;
}