1115 Counting Nodes in a BST （30 分）

1115 Counting Nodes in a BST （30 分）

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

#include<iostream>
#include<vector>
using namespace std;
struct node{
	int data;
	struct node *lchild,*rchild;
};
int depth = -1;
vector<int> ans(1000,0);
node* create(node *root,int a){
	if(root==NULL){
		root = new node();
		root->data = a;
		root->lchild = root->rchild = NULL;
	}else if(root->data >= a){
		root->lchild = create(root->lchild,a);
	}else{
		root->rchild = create(root->rchild,a);
	}
	return root;
}
void dfs(node *root,int h){
	if(root == NULL){
		depth = max(h,depth);
		return ;
	}
	ans[h]++;
	dfs(root->lchild,h+1);
	dfs(root->rchild,h+1);
}
int main(){
	int n;
	struct node *root = NULL;
	cin >> n;
	for(int i = 0;i < n;i++){
		int a;
		cin >> a;
		root = create(root,a);
	}
	dfs(root,0);
	printf("%d + %d = %d",ans[depth-1],ans[depth-2],ans[depth-1]+ans[depth-2]);
	return 0;
}