【PAT】【Advanced Level】1115. Counting Nodes in a BST (30)

1115. Counting Nodes in a BST (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 or equal to the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• Both the left and right subtrees must also be binary search trees.

Insert a sequence of numbers into an initially empty binary search tree. Then you are supposed to count the total number of nodes in the lowest 2 levels of the resulting tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=1000) which is the size of the input sequence. Then given in the next line are the N integers in [-1000 1000] which are supposed to be inserted into an initially empty binary search tree.

Output Specification:

For each case, print in one line the numbers of nodes in the lowest 2 levels of the resulting tree in the format:

n1 + n2 = n

where n1 is the number of nodes in the lowest level, n2 is that of the level above, and n is the sum.

Sample Input:

9
25 30 42 16 20 20 35 -5 28

Sample Output:

2 + 4 = 6

原题链接：
https://www.patest.cn/contests/pat-a-practise/1115

思路：

模拟二叉搜索树的插入，同时记录层数，最后排序、统计。

CODE：

#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
typedef struct S
{
	int val;
	int ls,rs;
	int fl;
};
S T[N];
bool cmp(S a,S b)
{
	return a.fl>b.fl;
}
int main()
{
	int n;
	cin>>n;
	for (int i=0;i<n;i++)
	{
		T[i].ls=T[i].rs=-1;
	}
	cin>>T[0].val;
	T[0].fl=0;
	for (int i=1;i<n;i++)
	{
		int v;
		cin>>v;
		T[i].val=v;
		T[i].ls=-1;
		T[i].rs=-1;
		int h=0;
		int f=0;
		while(true)
		{
			if (v>T[h].val)
			{
				if (T[h].rs==-1)
				{
					T[h].rs=i;
					T[i].fl=f+1;
					break;
				}
				else
				{
					h=T[h].rs;
					f++;
				}
			}
			else
			{
				if (T[h].ls==-1)
				{
					T[h].ls=i;
					T[i].fl=f+1;
					break;
				}
				else
				{
					h=T[h].ls;
					f++;
				}
			}
		}
	}
	//for (int i=0;i<n;i++)	cout<<T[i].fl<<endl;
	sort(T,T+n,cmp);
	int a=0,b=0;
	for (int i=0;i<n;i++)
	{
		if (T[i].fl==T[0].fl)
			a++;
		else if ((T[i].fl==T[0].fl-1))
			b++;
		else
			break ;
	}
	cout<<a<<" + "<<b<<" = "<<a+b;
	return 0;
}