7-10 ZigZagging on a Tree（C语言版）

最新推荐文章于 2022-10-18 23:57:07 发布

James_PN

最新推荐文章于 2022-10-18 23:57:07 发布

阅读量1.9k

点赞数

CC 4.0 BY-SA版权

分类专栏：二叉树文章标签： c语言数据结构

本文链接：https://blog.csdn.net/James_PN/article/details/105227826

给定一棵所有键为不同正整数的二叉树，根据给定的后序和中序遍历序列，可以唯一确定这棵树。题目要求按照锯齿形层次顺序打印树中的数字。输入包含一个测试用例，首先给出节点总数N，接下来两行分别给出中序和后序遍历序列。输出应按照锯齿形层次顺序打印树的节点值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#define maxsize 30
#define ERROR -2
#define NULL 0
struct treenode
{
   
   
	int data;
	struct treenode* lson, * rson;
} *pointer;
struct record
{
   
   
	int level, data;
} r[maxsize];
int inorder[maxsize], postorder[maxsize], number, nodecounter = 0, levelnumber = 1;
s