1099 Build A Binary Search Tree (30point(s)) - C语言 PAT 甲级

1099 Build A Binary Search Tree (30point(s))

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

• The left subtree of a node contains only nodes with keys less than the node’s key.
• The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
• Both the left and right subtrees must also be binary search trees.

Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤100) which is the total number of nodes in the tree. The next N lines each contains the left and the right children of a node in the format left_index right_index, provided that the nodes are numbered from 0 to N−1, and 0 is always the root. If one child is missing, then −1 will represent the NULL child pointer. Finally N distinct integer keys are given in the last line.

Output Specification:

For each test case, print in one line the level order traversal sequence of that tree. All the numbers must be separated by a space, with no extra space at the end of the line.

Sample Input:

9
1 6
2 3
-1 -1
-1 4
5 -1
-1 -1
7 -1
-1 8
-1 -1
73 45 11 58 82 25 67 38 42

Sample Output:

58 25 82 11 38 67 45 73 42

题目大意：

输入 N 个节点的二叉查找树，先给出每个节点的左右孩子节点序号，再给出各节点的值，

输出其层序遍历

设计思路：

• 利用数组存储二叉搜索树
• 因为是二叉搜索树，节点的值序列排序后即为此树的中序遍历
• 中序遍历的过程中将节点值依次插入节点
• 再层序遍历一遍输出

编译器：C (gcc)

#include <stdio.h>

struct node {
        int d;
        int left, right;
};

struct node tree[110];

int cmp(const void *a, const void *b)
{
        return *((int *)a) - *((int *)b);
}

void inorder(int root, int *d, int *i)
{
        if (root == -1)
                return ;
        inorder(tree[root].left, d, i);
        tree[root].d = d[*i];
        (*i)++;
        inorder(tree[root].right, d, i);
}

void levelorder()
{
        int q[110] = {0}, front = 0, rear = 1, cnt = 1;
        int root;
        while (cnt > 0) {
                root = q[front];
                printf("%s%d", front == 0 ? "" : " ", tree[root].d);
                front++;
                cnt--;
                if (tree[root].left != -1) {
                        q[rear++] = tree[root].left;
                        cnt++;
                }
                if (tree[root].right != -1) {
                        q[rear++] = tree[root].right;
                        cnt++;
                }
        }
}

int main(void)
{
        int n;
        int d[110], i;

        scanf("%d", &n);
        for (i = 0; i < n; i++)
                scanf("%d%d", &tree[i].left, &tree[i].right);
        for (i = 0; i < n; i++)
                scanf("%d", &d[i]);
        qsort(d, n, sizeof(d[0]), cmp);
        int index = 0;
        inorder(0, d, &index);
        levelorder();
        return 0;
}