1099 Build A Binary Search Tree (30 分)二叉查找树

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

题意：输入一个二叉查找树的结点个数n，和每个结点对应的左右孩子结点的编号，如果没有结点的话，就置为-1，再输入结点个数的值，然后最后输出二叉查找树的层序遍历
思路：设置一个结构体存储结点的左孩子右孩子值和索引，层数，然后将输入的数组从小到大排序，再模拟中序序列遍历，然后按照中序序列排序。

#include<iostream>
#include<cstdio>
#include<stack> 
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<cctype>
#include<cstdlib>
#include<ctime>
#include<unordered_map>

using namespace std;

struct node {
	int data,l,r,index,level;
} a[100];

int b[100],cnt;

//按照中序排列 
bool cmp(node a,node b) {
	if(a.level != b.level) {
		return a.level < b.level;
	}
	return a.index < b.index;
}

//模拟中序序列遍历 
void dfs(int root,int index,int level) {
	if(a[root].l == -1 && a[root].r == -1) {
		a[root] = {b[cnt++],a[root].l,a[root].r,index,level};
	} else {
		if(a[root].l != -1) {
			dfs(a[root].l,index * 2 + 1,level + 1);
		}
		a[root] = {b[cnt++],a[root].l,a[root].r,index,level};
		if(a[root].r != -1) {
			dfs(a[root].r,index * 2 + 2,level + 1);
		}
	}
	
}

int main() {
	int n;
	scanf("%d",&n);
	for(int i = 0;i < n;i++) {
		scanf("%d%d",&a[i].l,&a[i].r);
	}	
	for(int i = 0;i < n;i++) {
		scanf("%d",&b[i]);
	}
	sort(b,b + n);
	
	dfs(0,0,0);
	sort(a,a + n,cmp);
	for(int i = 0;i < n;i++) {
		if(i != 0) {
			printf(" ");
		}
		printf("%d",a[i].data);
	}
	return 0;
}