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

Code:

#include <iostream>
#include <vector>
#pragma warning(disable:4996)
using namespace std;

struct Node
{
	int key, depth;
	Node *lchild, *rchild;
	Node(int v, int d): key(v), depth(d) { lchild = rchild = nullptr; }
};

vector<int> level_cnt;

void insert(Node *&root, int val, int depth)
{
	if (root == nullptr)
	{
		root = new Node(val, depth);
		level_cnt[depth]++;
		return;
	}
	if (root->key >= val)
		insert(root->lchild, val, depth + 1);
	else
		insert(root->rchild, val, depth + 1);
}

int main()
{
	int n;
	scanf("%d", &n);
	level_cnt.resize(n, 0);
	Node* head = nullptr;
	for (int i = 0; i < n; i++)
	{
		int val; scanf("%d", &val);
		insert(head, val, 0);
	}
	int r1 = 0;
	while (r1 < n && level_cnt[r1] > 0) r1++;
	r1 = (r1 > 0 ? r1 - 1 : 0);
	printf("%d + %d = %d\n", level_cnt[r1], (r1 > 0 ? level_cnt[r1 -1] : 0), level_cnt[r1] + (r1 > 0 ? level_cnt[r1 - 1] : 0));
	return 0;
}