pat1099 Build A Binary Search Tree

题意：输入一颗排序二叉树的结构，再输入一个序列，把序列中的值放到二叉树里，最后层序输出。

思路：建树，排序，中序，层序。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>

using namespace std;

const int MAX_N = 110;
int v[MAX_N], lc[MAX_N], rc[MAX_N];
int a[MAX_N], n, root, x ,y;
int ind;
void inorder(int rt) {
    if (rt == -1) return ;
    inorder(lc[rt]);
    v[rt] = a[ind++];
    inorder(rc[rt]);
}
int lev[MAX_N], len;
void level(int rt) {
    len = 0;
    queue<int> q;
    q.push(rt);
    while (!q.empty()) {
        int t = q.front(); q.pop();
        lev[len++] = v[t];
        if (lc[t] != -1) q.push(lc[t]);
        if (rc[t] != -1) q.push(rc[t]);
    }
}

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d", &n);    
    root = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &x, &y);
        lc[i] = x; rc[i] = y;
    }
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    sort(a, a + n);
    ind = 0;
    inorder(root);
    level(root);
    for (int i = 0; i < len; i++) {
        if (i > 0) printf(" ");
        printf("%d", lev[i]);
        if (i == len-1) printf("\n");
    }
    return 0;
}