1115 Counting Nodes in a Binary Search Tree

目录

Input Specification:

Output Specification:

Sample Input:

Sample Output:

C++：

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:

10
25 30 42 16 20 20 35 -5 28 22

Sample Output:

3 + 4 = 7

C++：

#include <bits/stdc++.h>
using namespace std;

int n,cnt[1010],max_depth;
map<double,int> v,f;

void insert(double root,int data,int depth)
{
	if(f[root]==0)
	{
		f[root]=1;
		max_depth=max(max_depth,depth);
		cnt[depth]++;
		v[root]=data;
		return ;
	}
	if(v[root]>=data&&f[root]==1)
	{
		insert(2*root,data,depth+1);
	}
	else if(v[root]<data&&f[root]==1)
	{
		insert(2*root+1,data,depth+1);
	}
}

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		int data;
		scanf("%d",&data);
		insert(0.00001,data,0);
	}
	printf("%d + %d = %d\n",cnt[max_depth],cnt[max_depth-1],cnt[max_depth-1]+cnt[max_depth]);
	return 0;
}