PAT 1099. Build A Binary Search Tree

最新推荐文章于 2019-07-28 21:02:13 发布

solin205

最新推荐文章于 2019-07-28 21:02:13 发布

阅读量683

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/solin205/article/details/44565329

版权

PAT 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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 <stdio.h>
#include <algorithm>
#include <queue>
using namespace std;
struct Node
{
	int val, lc, rc;
	int cntL, cntR;
};
int N, input[110];
Node list[110];

int fun(int root)
{
	if(root == -1)
	{
		return 0;
	}
	list[root].cntL = fun(list[root].lc);
	list[root].cntR = fun(list[root].rc);
	return list[root].cntL + list[root].cntR + 1;
}

void setVal(int root, int ls, int rs)
{
	if(root == -1)
	{
		return;
	}
	int temp = list[root].cntL + ls;
	list[root].val = input[temp];
	setVal(list[root].lc, ls, list[root].cntL);
	setVal(list[root].rc, temp + 1, rs);
}

int main()
{
	while(scanf("%d", &N) != EOF)
	{
		for(int i = 0; i < N; i++)
		{
			scanf("%d %d", &list[i].lc, &list[i].rc);
			list[i].cntL = 0;
			list[i].cntR = 0;
		}
		for(int i = 0; i < N; i++)
		{
			scanf("%d", &input[i]);
		}
		sort(input, input + N);
		fun(0);
		setVal(0, 0 ,N - 1);
		queue<Node> dp;
		dp.push(list[0]);
		int level = 0;
		while(dp.size())
		{
			int length = dp.size();
			level++;
			for(int i = 0; i < length; i++)
			{
				if(dp.front().lc != -1)
				{
					dp.push(list[dp.front().lc]);
				}
				if(dp.front().rc != -1)
				{
					dp.push(list[dp.front().rc]);
				}
				if(level == 1)
				{
					printf("%d", dp.front().val);
				}
				else
				{
					printf(" %d", dp.front().val);
				}
				dp.pop();
			}
		}
		printf("\n");
	}
	return 0;
}