第一行输入结点个数
第二行输入中序遍历的结点顺序
第三行输入前序遍历的结点顺序
最后输出层序遍历的答案
输入样例:
7
4 2 5 1 6 3 7
1 2 4 5 3 6 7
输出样例:
1 2 3 4 5 6 7
//代码如下
#include <iostream>
#include <queue>
using namespace std;
typedef struct node{
int v;
node *lchild, *rchild;
}tree;
int n, in[100], pre[100];
tree* creat(int inleft, int inright, int preleft, int preright)
{
if(preleft > preright) return nullptr;
tree *root = new tree;
root->v = pre[preleft];
int k;
for(k = inleft; k <= inright; k++) {
if(in[k] == pre[preleft])
break;
}
int numleft = k - inleft;
root->lchild = creat(inleft, inleft + numleft - 1, preleft + 1, preleft + numleft);
root->rchild = creat(k + 1, inright, preleft + numleft + 1, preright);
return root;
}
void BFS(tree *root)
{
queue<tree*> q;
q.push(root);
while(!q.empty()) {
tree *temp = q.front();
printf("%d ",temp->v);
q.pop();
if(temp->lchild != nullptr) q.push(temp->lchild);
if(temp->rchild != nullptr) q.push(temp->rchild);
}
}
int main()
{
cin >> n;
for(int i = 0; i < n; i++)
cin >> in[i];
for(int i = 0; i < n; i++)
cin >> pre[i];
tree *root = creat(0, n-1, 0, n-1);
BFS(root);
return 0;
}