9.3 1099 Build A Binary Search Tree (30 分)

#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 1001;
int n;
int indexn[maxn],ans[maxn],ind = 0,num = 0;

struct node
{
    int data;
    int l,r;
}Node[maxn];

void inO(int root)
{
    if(root == -1)return;

    inO(Node[root].l);
    Node[root].data = indexn[ind++];
    inO(Node[root].r);
}

void leveO(int root)
{
    queue<int>q;
    q.push(root);
    while(!q.empty())
    {
        int s = q.front();
        printf("%d",Node[s].data);
        num++;
        if(num<n)
            printf(" ");
        q.pop();
        if(Node[s].l!=-1)
            q.push(Node[s].l);
        if(Node[s].r!=-1)
            q.push(Node[s].r);
    }
}

int main()
{
    // freopen("1.txt","r",stdin);
    scanf("%d",&n);

    for(int i = 0;i<n;i++)
    {
        int lc,rc;
        scanf("%d%d",&lc,&rc);
        Node[i].l = lc;
        Node[i].r = rc;
    }
    for(int i = 0;i<n;i++)
    {
        scanf("%d",&indexn[i]);
    }
    sort(indexn,indexn+n);
    inO(0);
    leveO(0);
    return 0;
}