1099 Build A Binary Search Tree (30 分)

最新推荐文章于 2022-10-27 05:00:48 发布

感觉自己就是个bug

最新推荐文章于 2022-10-27 05:00:48 发布

阅读量55

点赞数

分类专栏： pat甲级树

本文链接：https://blog.csdn.net/shshbdhsjjd/article/details/114240821

版权

pat甲级同时被 2 个专栏收录

181 篇文章 1 订阅

订阅专栏

树

37 篇文章 0 订阅

订阅专栏

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

#include<bits/stdc++.h>
using namespace std;
struct node {
	int l, r, val;
}data[200]; 
int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d %d", &data[i].l, &data[i].r);
	}
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &v[i]);
	}
	sort(v.begin(), v.end());
	stack<int> s;
	int root = 0, t = 0;
	while (!s.empty() || root != -1) {
		while (root != -1) {
			s.push(root);
			root = data[root].l;
		}
		int temp = s.top();
		s.pop();
		data[temp].val = v[t++];
		if (data[temp].r != -1) root = data[temp].r;
	}
	queue<int> Q;
	Q.push(0);
	while (!Q.empty()) {
		int temp = Q.front();
		Q.pop();
		if (temp != 0) printf(" ");
		printf("%d", data[temp].val); 
		if (data[temp].l != -1) Q.push(data[temp].l);
		if (data[temp].r != -1) Q.push(data[temp].r);
	}
}