PAT (Advanced Level)-1115 Counting Nodes in a BST

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>
using namespace std;

struct node
{
	int data;
	struct node *left,*right;
	node(int v):data(v),left(NULL),right(NULL){}
};
int lowest=-1,n1,n2;
int get_height(node *root)
{
	return root==NULL?0:max(get_height(root->left),get_height(root->right))+1;
}
node *buildtree(node *root,int v)
{
	if(root==NULL)
	{
		root=new node(v);
	}
	else if(v<=root->data)
	{
		root->left=buildtree(root->left,v);
	}
	else root->right=buildtree(root->right,v);
	return root;
}
void dfs(node*root,int level)
{
	if(root==NULL)return;
	if(level==lowest)n1++;
	if(level==lowest-1)n2++;
	dfs(root->left,level+1);
	dfs(root->right,level+1);	
}
int main()
{
	int n,t;
	scanf("%d",&n);
	node *root=NULL;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&t);
		root=buildtree(root,t);
	}
	lowest=get_height(root);
	dfs(root,1);
	printf("%d + %d = %d\n",n1,n2,n1+n2);	
}