(pat)A1099. Build A Binary Search Tree

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<cstdio>
#include<stack>
#include<algorithm>
#include<queue>
using namespace std;

struct node
{
    int data;
    int l;
    int r;
}p[105];
int a[105];
int num=0;
void in(int root)
{
    if(root==-1)
        return;
    in(p[root].l);
    p[root].data=a[num++];
    in(p[root].r);
}
void level()
{
    queue<int> que;
    que.push(0);
    num=0;
    while(!que.empty())
    {
        int temp=que.front();
        que.pop();
        a[num++]=p[temp].data;
        if(p[temp].l!=-1)
            que.push(p[temp].l);
        if(p[temp].r!=-1)
            que.push(p[temp].r);
    }
}
int main()
{
    int n;
    cin>>n;
    int x,y;
    for(int i=0;i<n;i++)
    {
        cin>>x>>y;
        p[i].l=x;
        p[i].r=y;
    }
    for(int i=0;i<n;i++)
        cin>>a[i];
    sort(a,a+n);
    in(0);
    level();
    for(int i=0;i<n-1;i++)
        printf("%d ",a[i]);
    printf("%d",a[n-1]);
    return 0;
}