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
题意:给出一串数字,将它们建成二叉搜索树,输出最后二层的结点数
解题思路:建树(套模板),然后dfs,用book保存每一层结点数,最后按要求输出数组最后2个数,具体的见代码
#include<iostream>
#include<vector>
using namespace std;
struct node{
int v;
struct node *left,*right;
};
node *build(node *root,int v)
{
if(root==NULL)
{
root=new node();
root->left=NULL;
root->right=NULL;
root->v=v;
}
else if(v<=root->v) root->left=build(root->left,v);
else root->right=build(root->right,v);
return root;
}
vector<int>book(1001);
int maxdepth=-1;
void dfs(node *root,int depth)
{
if(root==NULL)
{
maxdepth=max(depth,maxdepth);
return;
}
book[depth]++;
dfs(root->left,depth+1);
dfs(root->right,depth+1);
}
//void inorder(node*root)
//{
// if(root==NULL) return;
//
// printf("%d ",root->v);
// inorder(root->left);
// inorder(root->right);
//}
int main(void)
{
int n,num;
scanf("%d",&n);
node*root=NULL;
for(int i=0;i<n;i++)
{
scanf("%d",&num);
root=build(root,num);
}
dfs(root,0);
printf("%d + %d = %d",book[maxdepth-1],book[maxdepth-2],book[maxdepth-1]+book[maxdepth-2]);
// inorder(root);
return 0;
}