1127 ZigZagging on a Tree（30 分）（C++）

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.

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 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

考点：树的遍历之后序中序转层次；

其实什么之字形都是花架子，能得到层次遍历一切就迎刃而解，只是存储和输出层次遍历的时候动动手脚就好啦

#include <iostream>
#include <vector>
using namespace std;
std::vector<int> node(100005,-1),in(35),post(35),levelcnt[35];
void pretravel(int inleft, int inright,int postright, int level){
    if(inleft > inright)
        return;
    int i = inleft;
    while(in[i] != post[postright])
        ++ i;
    levelcnt[level].push_back(post[postright]);
    pretravel(inleft, i - 1, postright - inright + i -1, level + 1);
    pretravel(i + 1, inright, postright - 1, level + 1);
}
int main(){
    int n, cnt = 0;
    cin>>n;
    for(int i = 0; i < n; i++)
        scanf("%d",&in[i]);
    for(int i = 0; i < n; i++)
        scanf("%d",&post[i]);
    pretravel(0, n - 1, n - 1, 0);
    printf("%d",levelcnt[0][0]);
    for(int i = 1; i < 35; ++ i){
        if(i % 2 == 1)
            for(int j = 0; j < levelcnt[i].size(); ++ j)
                printf(" %d",levelcnt[i][j]);
        else
            for(int j = levelcnt[i].size() - 1; j >= 0; -- j)
                printf(" %d",levelcnt[i][j]);
    }
}