1115 Counting Nodes in a BST (30分)

1.建造树

2.在建造的时候记录所在层的节点数 

3.记录所在最深层

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 1000+5;

struct Node {
	Node *l, *r;
	int data;
	Node() {
		l = NULL;
		r = NULL;
	}
} *Root;
int Maxl = 0;
int Num[N];
void Insert(Node * &root, int val, int level) {
	if(root==NULL) {
		root = new Node();
		root->data = val;
		Maxl = max(Maxl, level);
		Num[level]++;
	} else if(val <= root->data)
		Insert(root->l,  val, level+1);
	else if(val > root->data)
		Insert(root->r,  val, level+1);

}
int main() {

	int n, tmp;

	cin >> n;
	Root = NULL;
	for(int i=0; i<n; i++) {
		cin >> tmp;
		Insert(Root, tmp, 0);
	}
	printf("%d + %d = %d\n", Num[Maxl], Num[Maxl-1], Num[Maxl]+Num[Maxl-1]);
	return 0;
}