1115 Counting Nodes in a BST（30 分）（C++）

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

题目大意：对给定的一串数字序列建立一个BST，计算该BST的最低一层和最低二层的节点数之和。

PAT中少数几题用链式存储方式解决树问题的一题

#include <iostream>
#include <vector>
using namespace std;
const int inf = 0xffffffff;
vector<int>levelcnt(1005, 0);
int n, maxlevel = 0, temp;
struct node{
	int value;
	node *left, *right;
	node(int x): value(x), left(nullptr), right(nullptr){};
};
node *insert(node *root, int val, int level){
	if(root == nullptr){
		root = new node(val);
		levelcnt[level] ++;
		maxlevel = max(maxlevel, level);
	}
	else if(root->value < val)
		root->right = insert(root->right, val, level + 1);
	else
		root->left = insert(root->left, val, level + 1);
	return root;
}
int main(){
	scanf("%d", &n);
	node *root = nullptr;
	for(int i = 0; i < n; ++ i){
		scanf("%d", &temp);
		root = insert(root, temp, 0);
	}
	printf("%d + %d = %d",levelcnt[maxlevel],levelcnt[maxlevel-1],levelcnt[maxlevel]+levelcnt[maxlevel-1]);	
}