解题思路:
1.按照后续遍历和中序遍历序列递归生成相应的树,再按层序遍历输出即可;
2.有关根据中序遍历和后续遍历获取树的方法可参考数据结构参考书。
C++代码如下:
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 40;
int postOrder[maxn];
int inOrder[maxn];
struct Node
{
int data;
Node *lchild, *rchild;
};
//创建二叉树
//递归创建
//每次取后续遍历序列对应的最后一个数据
//l1, r1, l2, r2分别为后续遍历子树序列起始和结尾,中序遍历子树序列的开头和结尾
Node* CreateTree(int l1, int r1, int l2, int r2)
{
if(l1 > r1)
return NULL;
Node* root = new Node;
root->data = postOrder[r1];
int k = l2;
for(int i = l2; i <= r2; i++)
{
if(postOrder[r1] == inOrder[i])
{
k = i;
break;
}
}
int len = k - l2;
root->lchild = CreateTree(l1, l1 + len - 1, l2, k - 1);
root->rchild = CreateTree(l1 + len, r1 - 1, k + 1, r2 );
return root;
}
//层序遍历
void LevelOrder(Node* root)
{
queue<Node*> Q;
Q.push(root);
int flag = 0;
while(!Q.empty())
{
Node* top = Q.front();
Q.pop();
if(flag == 0)
{
printf("%d", top->data);
flag = 1;
}
else
printf(" %d", top->data);
if(top->lchild != NULL) Q.push(top->lchild);
if(top->rchild != NULL) Q.push(top->rchild);
}
printf("\n");
}
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
for(int i = 0; i < n; i++)
scanf("%d", &postOrder[i]);
for(int i = 0; i < n; i++)
scanf("%d", &inOrder[i]);
Node *root = CreateTree(0, n - 1, 0, n - 1);
LevelOrder(root);
}
return 0;
}