1099 Build A Binary Search Tree （30 分）

版本2

根据BST中序遍历的特性进行插入值。

#include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <algorithm> 
#include <unordered_set>
#include <unordered_map>
#include <queue>
using namespace std;
const int N = 105;
int in[N];
int arr[N];
vector<int> G[N];
unordered_map<int, int> mp;
int k = 0;
void inorder(int root){
	if(root == -1) return;
	inorder(G[root][0]);
	mp[root] = arr[k++];
	inorder(G[root][1]);
}
bool flag = false;
void levelorder(int root){
	queue<int> q;
	q.push(root);
	while(q.size()){
		int t = q.front();
		q.pop();
		if(!flag){
			printf("%d", mp[t]);
			flag = true;
		}else{
			printf(" %d", mp[t]);
		}
		if(G[t][0] != -1) q.push(G[t][0]);
		if(G[t][1] != -1) q.push(G[t][1]);
	}
}
int main(){
	int n, u, v;
	scanf("%d", &n);
	memset(in, 0, sizeof in);
	for(int i = 0; i < n; i++){
		scanf("%d%d", &u, &v);
		G[i].push_back(u);
		G[i].push_back(v);
		in[u]++;
		in[v]++;
	}
	int root;
	for(int i = 0; i < n; i++){
		if(!in[i]) {
			root = i;
			break;
		}
	}
	for(int i = 0; i < n; i++){
		scanf("%d", &arr[i]);
	}
	sort(arr, arr+n);
	inorder(root);
	levelorder(root);
	return 0;
}

版本1

树中出现了按层或者顺序编号的情景，首先想到用树的静态写法。

#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=110;
int n;
struct node{
	int data;
	int left,right;
}Node[maxn];
vector<int> num,layer;
void inorder(int root){   
	if(root==-1) return;
	inorder(Node[root].left);
	num.push_back(root);
	inorder(Node[root].right);
}
void layerorder(int root){
	queue<int> q;
	q.push(root);
	while(!q.empty()){
		int temp = q.front();
		layer.push_back(Node[temp].data);
		q.pop();
		if(Node[temp].left != -1) q.push(Node[temp].left);
		if(Node[temp].right != -1) q.push(Node[temp].right);
	}
}
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d%d",&Node[i].left,&Node[i].right);
	}
	vector<int> org;
	int u;
	for(int i=1;i<=n;i++){
		scanf("%d",&u);
		org.push_back(u);
	}
	sort(org.begin(),org.end());
	inorder(0);
	for(int i=0;i<n;i++){
		Node[num[i]].data = org[i];
	}
	layerorder(0);
	for(int i=0;i<layer.size();i++){
		printf(i==0?"%d":" %d",layer[i]);
	}
	return 0;
}