【PAT】1099. Build A Binary Search Tree

考查点：BST，BFS，中序遍历

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i > = y; i--)
#define MAXN 110
#define oo 0x3f3f3f3f
using namespace std;

int a[MAXN];

struct node{
    int data,lch,rch;
}Node[MAXN];
int num;
 int n;
void inorder(int root)
{
    if(root==-1) return;
    inorder(Node[root].lch);
    Node[root].data=a[num++];
    inorder(Node[root].rch);
}
void BFS()
{
    int cnt=0;
    queue<int> q;
    q.push(0);
    while(!q.empty())
    {
        int t=q.front();
        q.pop();
        printf("%d",Node[t].data);
        if(cnt!=n-1){
            printf(" ");
        }
        cnt++;
        if(Node[t].lch!=-1) q.push(Node[t].lch);
        if(Node[t].rch!=-1) q.push(Node[t].rch);

    }
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    scanf("%d",&n);
    FOR(i,0,n)
    {
        int l,r;
        scanf("%d%d",&l,&r);
        Node[i].lch=l,Node[i].rch=r;
    }
    FOR(i,0,n)
    scanf("%d",&a[i]);
    sort(a,a+n);
    inorder(0);
    BFS();
    return 0;
}

思路：用静态数组存储BST，利用中序遍历是递增序列方法填充BST，之后BFS即可

提交情况：以后用scanf一定要记住&