1127 ZigZagging on a Tree (30point(s)) - C语言 PAT 甲级

最新推荐文章于 2021-10-17 22:24:53 发布

有三只土豆

最新推荐文章于 2021-10-17 22:24:53 发布

阅读量573

点赞数

分类专栏： PAT 甲级文章标签： PAT 甲级 C语言

本文链接：https://blog.csdn.net/huaxuewan/article/details/107186284

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1127 ZigZagging on a Tree (30point(s))

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

题目大意：

有 N 个节点的树，给出中序和后序遍历

输出 Z 字型的层序遍历，偶数层从右向左输出

设计思路：

利用队列进行层序遍历，利用栈进行 Z 字型输出

层序遍历，正常顺序入队
偶数层出队，直接入栈，不打印
奇数层出队前，先让栈中所有元素出栈，再出队并打印
若树的最大层数为偶数，节点均出队后，栈中会有剩余元素未输出，所以用队列遍历完后，要把栈中剩余元素打印

编译器：C (gcc)

#include <stdio.h>

struct node {
        int iroot, left, right;
        int level;
};

int in[35], post[35];
int stack[35], scnt;
struct node queue[35];
int qcnt, front, rear;

int main(void)
{
        int n;
        int i;

        scanf("%d", &n);
        for (i = 0; i < n; i++)
                scanf("%d", &in[i]);
        for (i = 0; i < n; i++)
                scanf("%d", &post[i]);

        queue[0].iroot = n - 1;
        queue[0].left = 0;
        queue[0].right = n - 1;
        queue[0].level = 0;
        front = 0;
        rear = 1;
        qcnt = 1;

        while (qcnt) {
                int iroot = queue[front].iroot;
                int left = queue[front].left;
                int right = queue[front].right;
                int level = queue[front].level;
                if (queue[front].level % 2 == 0) {
                        stack[scnt] = post[iroot];
                        scnt++;
                } else {
                        for (i = scnt - 1; i >= 0; i--)
                                printf("%s%d", stack[i] == post[n - 1] ? "" : " ", stack[i]);
                        scnt = 0;

                        printf(" %d", post[iroot]);
                }
                front++;
                qcnt--;
                int index = left;
                while (in[index] != post[iroot])
                        index++;
                if (left <= index - 1) {
                        queue[rear].iroot = iroot - 1 + index - right;
                        queue[rear].left = left;
                        queue[rear].right = index - 1;
                        queue[rear].level = level + 1;
                        rear++;
                        qcnt++;
                }
                if (index + 1 <= right) {
                        queue[rear].iroot = iroot - 1;
                        queue[rear].left = index + 1;
                        queue[rear].right = right;
                        queue[rear].level = level + 1;
                        rear++;
                        qcnt++;
                }
        }
        for (i = scnt - 1; i >= 0; i--)
                printf("%s%d", stack[i] == post[n - 1] ? "" : " ", stack[i]);

        return 0;
}