PAT 1099 甲级

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.

figBST.jpg
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

经典的二叉树前序遍历和层次遍历。
根据Input，利用数组Node[maxn]建立空的二叉树模型。
对给出的序列，进行排序，然后根据前序遍历顺序，依次赋值。
最后，利用辅助队列，进行层次遍历，输出结果。

#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

struct Node {
	int ID;
	int leftchild;
	int rightchild;
	int value;
	Node():ID(-1) {	}
} nodes[100];

int N;
bool visited[100] = {false};
int k = 0;
queue<Node> q;

void InorderTravel(int sequence[],Node *root) {
	if(root->leftchild != -1) {
		InorderTravel(sequence,&nodes[root->leftchild]);
	}
	root->value = sequence[k++];
	if(root->rightchild != -1) {
		InorderTravel(sequence,&nodes[root->rightchild]);
	}
}

void LevelTravel(Node root) {
	int cnt = 0;
	q.push(root);
	visited[root.ID] = true;
	Node temp;
	while(!q.empty()) {
		temp = q.front();
		q.pop();
		cout<<temp.value;
		cnt++;
		if(cnt < N) {
			cout<<" ";
		}
		if(temp.leftchild != -1) {
			q.push(nodes[temp.leftchild]);
		}
		if(temp.rightchild != -1) {
			q.push(nodes[temp.rightchild]);
		}
	}
}

int main() {
	int sequence[100];
	cin>>N;
	for(int i = 0; i < N; i++) {
		cin>>nodes[i].leftchild>>nodes[i].rightchild;
		nodes[i].ID = i;
	}
	for(int i = 0; i < N; i++) {
		cin>>sequence[i];
	}
	sort(sequence,sequence + N);
	InorderTravel(sequence,nodes);//填入数据
	k = 0;
	//层次遍历输出
	LevelTravel(nodes[0]);
	return 0;
}

前辈传送门…