PAT A1115. 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 [-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<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
#include<queue>
const int Max = 1001;
using namespace std;
struct node
{
	int data;
	node *lchild,*rchild;
	int height;
}*root;
node* CreatNode(int x)
{
	node *q=new node;
	q->data=x;
	q->height=1;
	q->lchild=q->rchild=NULL;
	return q;
}
int getHeight(node * &root)
{
	if(root==NULL) return 0;
	return root->height;
}
void Update(node* &root)
{
	root->height=max(getHeight(root->lchild),getHeight(root->rchild))+1;
}
void Insert(node* &root,int x,int h)
{
	if(root==NULL)
	{
		root=CreatNode(x);
		root->height=h;
		return ;
	}
	if(x<=root->data)
	{
		Insert(root->lchild,x,h+1);
	}
	else
	{
		Insert(root->rchild,x,h+1);
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		int temp;
		scanf("%d",&temp);
		Insert(root,temp,1);
	}
	queue<node*> q;
	int S[Max]={0};
	q.push(root);
	int k=0;
	while(!q.empty())
	{
		node *t=q.front();
		S[t->height]++;
		if(t->height>k) k=t->height;
		q.pop();
		//printf("%d %d\n",t->data,t->height);
		if(t->lchild!=NULL)
			q.push(t->lchild);
		if(t->rchild!=NULL)
			q.push(t->rchild);
	}
	printf("%d + %d = %d\n",S[k],S[k-1],S[k]+S[k-1]);
	system("pause");
	return 0;
}