PAT 甲级 1115 Counting Nodes in a BST

本文介绍了一种算法，用于在二叉搜索树（BST）中计算最低两层的节点总数。通过建立BST并进行层次遍历，记录每层的节点数量，最后输出最下两层的节点数量及其总和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1115 Counting Nodes in a BST （30 point(s)）

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 [−10001000] 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

经验总结：

emmmm 很水的一道三十分题，比前几题简单多了....先建立BST树，然后进行层次遍历，记录每一层的结点数目，最后输出最下面两层的结点数目以及他们之和即可~

AC代码

#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=1010;
int n,a,maxlevel=-1,num[maxn]={0};
struct node
{
	int data,level;
	node *lchild,*rchild;
};
void insert(node *&root, int data)
{
	if(root==NULL)
	{
		root=new node();
		root->data=data;
		root->lchild=root->rchild=NULL;
		return ;
	}
	if(data<=root->data)
		insert(root->lchild,data);
	else
		insert(root->rchild,data);
}
void BFS(node * root)
{
	queue<node *> q;
	root->level=1;
	if(root->level>maxlevel)
	{
		++num[root->level];
		maxlevel=root->level;
	}
	q.push(root);
	while(q.size())
	{
		node * x=q.front();
		q.pop();
		int tlevel=x->level+1;
		if(x->lchild!=NULL)
		{

			x->lchild->level=tlevel;
			++num[tlevel];
			maxlevel=maxlevel>tlevel?maxlevel:tlevel;
			q.push(x->lchild);
		}
		if(x->rchild!=NULL)
		{
			x->rchild->level=tlevel;
			++num[tlevel];
			maxlevel=maxlevel>tlevel?maxlevel:tlevel;
			q.push(x->rchild);
		}
	}
}

int main()
{
	scanf("%d",&n);
	node * root=NULL;
	for(int i=0;i<n;++i)
	{
		scanf("%d",&a);
		insert(root,a);
	}
	BFS(root);
	printf("%d + %d = %d\n",num[maxlevel],num[maxlevel-1],num[maxlevel-1]+num[maxlevel]);
	return 0;
}