#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
typedef pair<int, int> PII;
const int N = 100;
int pre[N], fin[N], mid[N];
struct Tree
{
int data;
int l, r;
} tr[N];
int tot, now, n, idx;
int build(int l, int r)
{
if (l > r)
return 0;
int m;
for (int i = l; i <= r; i++)
{
if (fin[now] == mid[i])
{
m = i;
break;
}
}
tr[++tot].data = fin[now--];
int root = tot;
tr[root].r = build(m + 1, r);
tr[root].l = build(l, m - 1);
return root;
}
void floorprint(int root)
{
queue<int> q;
if (root)
q.push(root);
while (q.size())
{
int u = q.front();
q.pop();
if (tr[u].l)
q.push(tr[u].l);
if (tr[u].r)
q.push(tr[u].r);
pre[idx++] = tr[u].data;
}
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> fin[i];
}
for (int i = 0; i < n; i++)
{
cin >> mid[i];
}
now = n - 1;
int root = build(0, n - 1);
floorprint(root);
for (int i = 0; i < idx; i++)
{
if (i != idx - 1)
cout << pre[i] << " ";
else
cout << pre[i];
}
return 0;
}
L2-006 树的遍历
最新推荐文章于 2024-09-23 14:50:51 发布
该程序使用C++编写,主要功能是根据给定的两个数组fin和mid构建一棵二叉搜索树,并进行层序遍历打印。首先读取n个整数存储在fin数组中,然后读取n个整数存储在mid数组中。通过build函数递归地构建二叉搜索树,最后用floorprint函数层次遍历并输出树的节点值。
摘要由CSDN通过智能技术生成