【PAT】A1127 ZigZagging on a Tree【树】

最新推荐文章于 2022-05-30 17:01:04 发布

原创

最新推荐文章于 2022-05-30 17:01:04 发布 · 744 阅读

给定二叉树的先序遍历序列，要求按Z型层次遍历输出节点。首先构建二叉树，然后在层次遍历过程中交替进行左右方向的节点添加。

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

题意

给出一个二叉树的先序遍历，求这棵二叉树的z型层次遍历（第二层正向遍历，第三层反向遍历，依次交替进行）

思路

第一层（根结点）我们可以看做是反向遍历，然后后面依次交替。由先序遍历我们很容易构建一棵二叉树（第一个元素是根结点，往后搜索第一个比根结点大的元素，它和它的后面的元素是根结点的右子树，前面的元素是根结点的左子树，递归建立即可）。对于Z型遍历，我们再层次遍历中依然是按照正常的从左到右的顺序将元素加入到遍历向量中，只是在取出的时候，根据当前层是否反向，进行正向或者反向加入到结果向量中。

代码

#include <cstdio>
#include <vector>
#define MAX_N 35
using namespace std;
struct Node{
   
   
    Node *left, *right;
    int value;
    Node(int value): value(value), left(NULL), right(NULL){
   
   };
}*root;
int in