1115 Counting Nodes in a BST-PAT甲级

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<bits/stdc++.h>
using namespace std;
const int N=1005;
int max_level=-1;//最大层数
int level_num[N];//每层的节点数 
struct node{
	int data;
	node *l=nullptr;
	node *r=nullptr;
	node(){}
	node(int d){
		data=d;
	}
};
void insert(node *&root,int x){
	if(root==nullptr){
		root=new node(x);
		return;
	}
	if(x<=(root->data)){
		insert(root->l,x);
	}
	if(x>(root->data)){
		insert(root->r,x);
	}
}
void dfs(node *root,int level){
	if(root==nullptr){
		max_level=max(max_level,level);
		return;
	}
	level_num[level]++;
	dfs(root->l,level+1);//遍历左子树
	dfs(root->r,level+1);//遍历右子树 
}
int n;
int main(){
	fill(level_num,level_num+N,0);
	cin>>n;
	node *root=nullptr;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		insert(root,x);
	}
	dfs(root,0);
	max_level--;
	printf("%d + %d = %d\n",level_num[max_level],level_num[max_level-1],level_num[max_level]+level_num[max_level-1]);
	return 0;
}