PAT-1020:Tree Traversals(树的遍历)

弱鸡一枚轻喷
更多资料:https://tinuv.me
更好的阅读体验https://tinuv.me/2019/01/19/264.html

题目

题目链接
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的值记录了有节点的值,然后排序(想想二叉树的数组表示法,顺序输出天然就是层次输出,这里接用这个思想)

代码

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


struct node {
   
    int index;
    int value;
};
vector<node> result;

void sp(int *ps,