1115 Counting Nodes in a BST (30分)——C/C++

1115 Counting Nodes in a BST (30分)

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

1. The left subtree of a node contains only nodes with keys less than or equal to the node’s key.
2. The right subtree of a node contains only nodes with keys greater than the node’s key.
3. 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

题目大意：

我的代码主要还是c语言，只在能简化的地方使用了c++。给出n个结点，构建二叉搜索树。即小于等于根结点的数据放在左子树，大于根结点的数据放在右子树，并且其左右子树也要符合这个规律。输出最后一层结点个数n1 + 倒数第二层结点个数n2 之和。

错误：

在一开始，我的第五个测试点一直通不过，后来发现忽略了只有根结点的情况，下面有错误代码和正确代码，希望能给大家一点启发。

错误代码：

#include <stdio.h>
#include <malloc.h>
#include <algorithm>
using namespace std;

typedef struct Node{
	int id;
	struct Node *right,*left;
}node;

int a[1010]={0};
int j=0;

node *Insert(node *root,int temp){
	node *s,*p,*q;
	s=(node *)malloc(sizeof(node));
	s->id=temp;
	s->left=s->right=NULL;
	p=root;
	if(p==NULL){
		root=s;
		a[j]++;
		return root;
	}
	while(p!=NULL){
		q=p;
		a[j]++;
		if(temp<=p->id){
			p=p->left;
		}
		else{
			p=p->right;
		}
	}
	if(temp<=q->id){
		q->left=s;
		a[j]++;
	}
	else{
		q->right=s;
		a[j]++;
	}
	return root;
}

bool compare(int a,int b)
{
    return a>b;
}
int main(){
	int n,i;
	node *root=NULL;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		int temp;
		scanf("%d",&temp);
		root=Insert(root,temp);
		j++;
	}
	sort(a,a+n,compare);
	int n1=1,n2=1;
	int flag=a[0];
	for(i=1;i<n;i++){
		if(a[i]==flag)
			n1++;
		else{
			if(a[i]==a[i+1])
				n2++;
			else
				break;
		}
	}
	printf("%d + %d = %d",n1,n2,n1+n2);
	return 0;
}

修改代码：

#include <stdio.h>
#include <malloc.h>
#include <algorithm>
using namespace std;

typedef struct Node{
	int id;
	struct Node *right,*left;
}node;

int a[1010]={0};
int j=0;

node *Insert(node *root,int temp){
	node *s,*p,*q;
	s=(node *)malloc(sizeof(node));
	s->id=temp;
	s->left=s->right=NULL;
	p=root;
	if(p==NULL){
		root=s;
		a[j]++;
		return root;
	}
	while(p!=NULL){
		q=p;
		a[j]++;
		if(temp<=p->id){
			p=p->left;
		}
		else{
			p=p->right;
		}
	}
	if(temp<=q->id){
		q->left=s;
		a[j]++;
	}
	else{
		q->right=s;
		a[j]++;
	}
	return root;
}

bool compare(int a,int b)
{
    return a>b;
}
int main(){
	int n,i;
	node *root=NULL;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		int temp;
		scanf("%d",&temp);
		root=Insert(root,temp);
		j++;
	}
	sort(a,a+n,compare);
	int n1=1,n2=1;
	int flag=a[0];
	for(i=1;i<n;i++){
		if(a[i]==flag)
			n1++;
		else{
			if(a[i]==a[i+1])
				n2++;
			else
				break;
		}
	}
	if(n==1)
		printf("1 + 0 = 0");
	else
	    printf("%d + %d = %d",n1,n2,n1+n2);
	return 0;
}