【PAT甲级A1099】Build A Binary Search Tree (30分)（c++）

1099 Build A Binary Search Tree (30分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：200 ms
内存限制：64 MB

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

题意：

给你一颗二叉树，形状固定了，要求将所给数列填进树的结点中，使其形成一颗二叉查找树，并将该树按层序遍历输出。

思路：

一看到二叉查找树，就应该条件反射的想到，它的中序遍历是升序的。
于是就能想到将所给数列升序表示后，将值赋值给中序树的结点。这里数的构建采用静态树的构建，用序列号来替代指针。

参考代码：

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;
struct Node {
    int value, left, right;
} node[101];
vector<int> v;
int n, cnt = 0;

void inorder(int index) {
    if (index == -1)return;
    inorder(node[index].left);
    node[index].value = v[cnt++];
    inorder(node[index].right);
}

void showlevelorder(int root) {
    queue<int> q;
    q.push(root);
    printf("%d", node[root].value);
    while (!q.empty()) {
        int top = q.front();
        q.pop();
        if (node[top].left != -1) {
            int newnode = node[top].left;
            q.push(newnode);
            printf(" %d", node[newnode].value);
        }
        if (node[top].right != -1) {
            int newnode = node[top].right;
            q.push(newnode);
            printf(" %d", node[newnode].value);
        }
    }
}

int main() {
    scanf("%d", &n);
    v.resize(n);
    for (int i = 0; i < n; i++)
        scanf("%d%d", &node[i].left, &node[i].right);
    for (int i = 0; i < n; i++)scanf("%d", &v[i]);
    sort(v.begin(), v.end());
    inorder(0);
    showlevelorder(0);
    return 0;
}

如有错误，欢迎指正