4.20 PAT 甲级 1020 Tree Traversals

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order 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 (≤30), the total number of nodes in the binary tree. The second line gives the postorder 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 level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.

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<iostream>
#include<unordered_map>
using namespace std;

const int M = 40;
int postorder[M],inorder[M],n;
unordered_map<int,int>l,r,pos;                  //l记录左孩子，r记录右孩子,pos记录中序遍历的每一个元素的所在位置
int q[M];

int build(int il,int ir,int pl,int pr)
{
    int root = postorder[pr];
    int k = pos[root];
    if(il < k) l[root] = build(il,k-1,pl,k-1-il+pl);
    if(k < ir) r[root] = build(k+1,ir,pr+k-ir,pr-1);
    return root;
}

void bfs(int root)
{
    int hh = 0,tt = 0;
    q[0] = root;

    while(hh <= tt)
    {
        int t = q[hh ++];
        if(l.count(t)) q[++ tt] = l[t];
        if(r.count(t)) q[++ tt] = r[t];
    }

    cout << q[0];
    for(int i = 1; i <= tt; i ++ )
        cout << ' ' << q[i];
}
int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++ )
        cin >> postorder[i];
    for(int i = 0; i < n; i ++ )
    {
        cin >> inorder[i];
        pos[inorder[i]] = i;
    }

    int root = build(0,n - 1,0,n - 1);
    bfs(root);

    return 0;
}

题意是给出后序遍历，中序遍历，然后让我们输出他的层序遍历。