问题描述:
参考 A1020 Tree Traversals (25 分)
输入树的中序和后序排列,输出树的层次遍历
Sample Input:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7
Sample Output:
4 1 6 3 5 7 2
代码如下:
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn = 50;
struct node{
int data;
node* lchild;
node* rchild;
};
int pre[maxn], post[maxn], in[maxn];
int n;
node* create(int postL, int postR, int inL, int inR){
if(postL > postR){
return NULL;
}
node* root = new node;
root->data = post[postR];
int k; //当前中序序列中root的位置
for(k = inL; k < inR; k++){
if(in[k] == post[postR]){
break;
}
}
int numLeft = k - inL; //左子树的节点个数
root->lchild = create(postL, postL + numLeft - 1, inL, k - 1);
root->rchild = create(postL + numLeft, postR - 1, k + 1, inR);
return root;
}
int num = 0; //记录输出的结点数,控制输出格式
void BFS(node* root){
queue<node*> q;
q.push(root);
while(!q.empty()){
node* now = q.front();
q.pop();
printf("%d", now->data);
num++;
if(num < n)
printf(" ");
if(now->lchild != NULL)
q.push(now->lchild);
if(now->rchild != NULL)
q.push(now->rchild);
}
}
int main(){
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", &post[i]);
}
for(int i = 0; i < n; i++){
scanf("%d", &in[i]);
}
node* root = create(0, n-1, 0, n-1);
BFS(root);
return 0;
}