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

解题思路：

1. 二叉搜索树插入
2. 求高
3. 遍历

AC代码：

#include <iostream> 
#include <malloc.h>
using namespace std;
#define Max 30
typedef struct node* tree;
struct node{
	int data;
	tree left;
	tree right;
};
int cnt1=0,cnt2=0;
tree CreateTree(tree t,int num);
int GetHeight(tree t);
void pretravel(tree t,int level,int H);
int main(){
	int N,num,i;
	tree t=NULL;
	cin>>N;
	for(i=0;i<N;i++){
		scanf("%d",&num);
		t=CreateTree(t,num);	
	}
	int H=GetHeight(t);
	pretravel(t,0,H);
	printf("%d + %d = %d",cnt1,cnt2,cnt1+cnt2);
	return 0;
}
tree CreateTree(tree t,int num){
	if(!t){
		tree head=(tree)malloc(sizeof(struct node));
		head->data=num;
		head->left=NULL;
		head->right=NULL;
		return head;	
	}
	else{
		if(num>t->data)
			t->right=CreateTree(t->right,num);
		else 
			t->left=CreateTree(t->left,num);	
		return t;
	}	
}
int GetHeight(tree t){
	int H;
	if(!t)
		H=0;
	else{
		int L=GetHeight(t->left);
		int R=GetHeight(t->right);
		H=1+(L>R?L:R);	
	}
	return H;		
}
void pretravel(tree t,int level,int H){
	level++;
	if(t){
		pretravel(t->left,level,H);
		if(level==H)
			cnt1++;
		else if(level==H-1)
			cnt2++;
		pretravel(t->right,level,H);		
	}	
}