PAT 甲级 1138 Postorder Traversal (25 分)

最新推荐文章于 2022-10-05 17:18:06 发布

原创最新推荐文章于 2022-10-05 17:18:06 发布 · 205 阅读

0 ·

CC 4.0 BY-SA版权

博客围绕二叉树展开，已知二叉树所有键为不同正整数，给出其前序和中序遍历序列，要求输出对应二叉树后序遍历序列的第一个数。分析指出可参考特定链接，直接模拟后序遍历，并用哈希表记录结点位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 50,000), the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:
For each test case, print in one line the first number of the postorder traversal sequence of the corresponding binary tree.

Sample Input:

7
1 2 3 4 5 6 7
2 3 1 5 4 7 6

Sample Output:

题目大意：
给出二叉树的前序遍历与中序遍历
求后序遍历的第一个结点

分析：
没有想到特别好的办法，参考了https://www.liuchuo.net/archives/4208，直接模拟后序遍历即可。
用哈希表记录每个结点在前序、中序遍历中的位置

#include <bits/stdc++.h>
using namespace std;

const int maxn = 50010;
int pre[maxn];
int in[maxn];
unordered_map<int, int>prePos;
unordered_map<int, int>inPos;

// 前序遍历找根
// 中序遍历找左右子树
bool flag = 0;
void postOrder(int preL, int inL, int inR)
{
    if (flag || inL > inR) return;
    int inRT = inPos[pre[preL]];
    postOrder(preL+1, inL, inRT-1);
    postOrder(preL+inRT-inL+1, inRT+1, inR);
    if (!flag)
    {
        cout << pre[preL] << endl;
        flag = 1;
    }

}

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> pre[i];
        prePos[pre[i]] = i;
    }
    for (int i = 1; i <= n; i ++)
    {
        cin >> in[i];
        inPos[in[i]] = i;
    }
    postOrder(1, 1, n);
    return 0;
}