PAT 甲级 1020 Tree Traversals (25分)

题目

1020 Tree Traversals (25分)

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

题目大意

给出树的后序、中序遍历，求出树的层序遍历

思路

采用递归构造树的思路，用index表示下标，根结点下标为1开始，父节点下标为index，左孩子为2 * index，右孩子为2 * index+1。

代码

#include<bits/stdc++.h>
using namespace std;
int N, maxlevel=0;
map<int, int> tree;
vector<int> post, in;
void create(int root, int left, int right, int index){
    if(left > right) return;
    int i=left;
    while(i<right && post[root] != in[i]) i++;
    tree[index] = post[root];
    create(root-right+i-1, left, i-1, 2*index);
    create(root-1, i+1, right, 2*index+1);
}
int main(int argc, const char * argv[]) {
    cin>>N;
    post.resize(N);
    in.resize(N);
    for(int i=0; i<N; i++)
        cin>>post[i];
    for(int i=0; i<N; i++)
        cin>>in[i];
    create(N-1, 0, N-1, 1);
    bool flag = true;
    for(auto it : tree){
        printf("%s%d", flag?"":" ", it.second);
        flag = false;
    }
    return 0;
}