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
随便瞄了一眼题意,大概懂了意思就开始做了,但是只有8分,!!!于是很纳闷,怎么都找不到错误,所以题目要认真看!!!他的定义左子树都要小于等于根结点,而我一开始是写成了小于,所以出错!!!
#include<iostream>
#include<algorithm>
#include<stack>
#include<string>
#include<set>
#include<vector>
#include<unordered_map>
#include<unordered_set>
#include<math.h>
#include<map>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=1010;
int n,m=0;
int res[maxn];
struct node{
int data;
node* left,*right;
node(int v){
data=v;
left=NULL;
right=NULL;
}
};
node* insert(node* root,int data){
if(root==NULL){
root=new node(data);
return root;
}
if(root->data<data){
root->right=insert(root->right,data);
}else root->left=insert(root->left,data);
return root;
}
void dfs(node* root,int level){
if(root==NULL){
return;
}
res[level]++;
m=max(m,level);
dfs(root->left,level+1);
dfs(root->right,level+1);
}
int main(){
int a,level=0;
scanf("%d",&n);
node* root=NULL;
for(int i=0;i<n;i++){
scanf("%d",&a);
root=insert(root,a);
}
dfs(root,0);
printf("%d + %d = %d",res[m],res[m-1],res[m]+res[m-1]);
return 0;
}