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 [−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

题解:

直接用链表创建树.创建时用hash保存每层的节点数即可 .

测试点5 可能给的样例树高不到2.需要输出0

 

#include <iostream>
using namespace std;

struct node
{
	int data, depth;
	node* left, *right;
};
int hashmap[1010];
node* newnode(int data, int depth) {
	node* tn = new node;
	tn->data = data;
	tn->depth = depth + 1;
	hashmap[depth + 1]++;
	tn->left = tn->right = NULL;
	return tn;
}
void insert(node *&root, int data, int depth) {
	if (root == NULL) {
		root = newnode(data, depth);
		return;
	}
	if (data > root->data) insert(root->right, data, root->depth);
	if (data <= root->data) insert(root->left, data, root->depth);
}
int main() {
	int n;
	cin >> n;
	node *root;
	for (int i = 0; i < n; i++)
	{
		int temp;
		cin >> temp;
		if (i == 0) root = newnode(temp, 0);
		else
		{
			insert(root, temp, 0);
		}
	}
	int cnt = 0, n1 = 0, n2 = 0;
	for (int i = 1001; i > 0; i--)
	{
		if (hashmap[i] == 0) continue;
		if (cnt == 0) 
		{
			n1 = hashmap[i];
			cnt++;
			continue;
		}
		if (cnt == 1) {
			n2 = hashmap[i];
			break;
		}
	}
	printf("%d + %d = %d", n1, n2, n1 + n2);
    return 0;
}