1115 Counting Nodes in a Binary Search Tree

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:

10
25 30 42 16 20 20 35 -5 28 22

Sample Output:

3 + 4 = 7

建树的时候就可以同时统计深度： 

#include <iostream>
#include <algorithm>
using namespace std;
int n, t, h[1010], maxx;

struct node {
	int val;
	node *left;
	node *right;
};

node *build(node *r, int x, int d) {
	if (r == NULL) {
		r = new node();
		r->val = x;
		r->left = r->right = NULL;
		h[d]++;
		maxx = max(maxx, d);
	} else if (r->val >= x) {
		r->left = build(r->left, x, d + 1);
	} else {
		r -> right = build(r->right, x, d + 1);
	}
	return r;
}

int main() {
	cin >> n;
	node *root = NULL;
	for (int i = 0; i < n; i++) {
		cin >> t;
		root = build(root, t, 1);
	}
	cout << h[maxx] << " + " << h[maxx - 1] << " = " << h[maxx] + h[maxx - 1];
	return 0;
}