PAT真题练习（甲级）1127 ZigZagging on a Tree (30 分)

最新推荐文章于 2022-03-01 19:38:29 发布

zyq-lucky

最新推荐文章于 2022-03-01 19:38:29 发布

阅读量257

点赞数 1

分类专栏：刷题笔记

本文链接：https://blog.csdn.net/fiona_77/article/details/100123908

版权

该博客主要介绍了PAT甲级编程竞赛中的题目1127——ZigZagging on a Tree。题目要求根据给定的后序和中序遍历序列构建一棵二叉树，并按锯齿形顺序输出树的节点值。博客给出了输入输出规格、示例以及AC（Accepted）代码。

摘要由CSDN通过智能技术生成

PAT真题练习（甲级）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.
在这里插入图片描述

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

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

Sample Output 1:

1 11 5 8 17 12 20 15

AC代码

#include<iostream>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include<map>
using namespace std;

struct Node {
   
	int left = -1;
	int right = -1;
};
unordered_map<int,Node> nodes