1115 Counting Nodes in a BST (30分)

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 [−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
#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<unordered_map>
#include<queue>
#include<climits>
#include<stack>
using namespace std;
const int maxn= 10000+10;

struct Node{
	int v;
	struct Node* left,*right;
		
};


int maxh=-1,n;

vector<int>num(maxn);

Node* build(Node* root ,int v){
	if(root ==NULL){
		root=new Node();
		root->v=v;
		root->left=NULL;
		root->right=NULL; 
	}else if(v<=root->v){
			root->left=build(root->left,v);
		
	}else{
		root->right=build(root->right,v);
		
	}
	return root;
}

void dfs(Node *root,int depth){
	if(root==NULL){
		maxh=max(maxh,depth);
		return;
	}
	num[depth]++;
	dfs(root->left,depth+1);
	dfs(root->right,depth+1);
}
 
int main(){
	cin>>n;
	int a;
	Node*root= NULL; 
	for(int i=0;i<n;i++) {
		cin>>a;
		root=build(root,a);
	}
	dfs(root,0);
	cout<<num[maxh-1]<<" + "<<num[maxh-2]<<" = "<<num[maxh-1]+num[maxh-2];
	
	
	
    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值