1127 ZigZagging on a Tree (30分)

题目

Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-order. However, if you think the problem is too simple, then you are too naive. This time you are supposed to print the numbers in “zigzagging order” – that is, starting from the root, print the numbers level-by-level, alternating between left to right and right to left. For example, for the following tree you must output: 1 11 5 8 17 12 20 15.

:::hljs-center

:::

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N(\le 30)$, the total number of nodes in the binary tree. The second line gives the inorder sequence and the third line gives the postorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the zigzagging sequence of the tree in a line. 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:

8
12 11 20 17 1 15 8 5
12 20 17 11 15 8 5 1

Sample Output:

1 11 5 8 17 12 20 15

题目大意

给出二叉树的中序遍历和后序遍历序列，建立二叉树，并按所给规则层次遍历该二叉树。

思路

按照中序和后序序列建树，再将层次遍历结果存入vector中，如当前层是奇数层，则将该层的节点反转，最后输出即可；

代码

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

struct node{
   
    int data;
    node *left, *right;
};

int n;
vector<int> inorder, postorder;
vector<int> ans, level