1115 Counting Nodes in a BST (30分) 建树 BST搜索二叉树 建树要小心可能不是完全二叉树

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 <iostream>
#include <vector>

using namespace std;

struct node
{
	node  *lkid, *rkid;
	int data,  level;
};

int cnt[1006],maxlevel=-1;//cnt数组记录每层的点的个数，maxlevel记录最深层的层数用于输出

void insert(node* &root,int data, int level)
{
	if (root==NULL)
	{
		root = new node();
		root->data = data;
		root->lkid = root->rkid = NULL;
		root->level = level;
		cnt[level]++;
		if (level>maxlevel)
		{
			maxlevel = level;
		}
		return;
	}
	if (data<=root->data)
	{
		insert(root->lkid, data, root->level + 1);
	}
	else
	{
		insert(root->rkid, data, root->level + 1);
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n;
	cin >> n;
	node* root=NULL;
	for (int i = 0; i < n; i++)
	{
		int t;
		cin >> t;
		insert(root,t, 1);
	}
	printf("%d + %d = %d\n", cnt[maxlevel], cnt[maxlevel - 1], cnt[maxlevel] + cnt[maxlevel - 1]);
	return 0;
}