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

#include <iostream>
using namespace std;
#define N 1005

struct Node{
	int key,height;
	Node* left,*right;
};
int length;

Node* newNode(int key){
	Node* root=new Node;
	root->key=key;
	root->height=0;
	root->left=NULL;
	root->right=NULL;
	return root;
}
int height=0;
int h[N]={0};
int hOpt=-1;
void insert(Node* &root,int key){
	if(root==NULL){
		root=newNode(key);
		h[height]++;
		if(height>hOpt)hOpt=height;
		return;
	}
	else{height++;
		if(root->key>=key){
			insert(root->left,key);
		}
		else insert(root->right,key);
	}
	return;
}


int main(){
	//freopen("test.txt","r",stdin);
	cin>>length;
	Node* root=NULL;
	int i;
	for(i=0;i<length;i++){
	int ls;
	cin>>ls;
	height=0;
	insert(root,ls);
	}
	cout<<h[hOpt]<<" + "<<h[hOpt-1]<<" = "<<h[hOpt]+h[hOpt-1]<<endl;
	return 0;
}