1115 Counting Nodes in a BST(甲级)

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<vector>
#include<algorithm>
using namespace std;
int n;
int num[1001]{ 0 };
int minx = -1;
struct info {int data;info* left;info* right;
};
void insert(info* &root, int value)
{if (!root){root = new info;root->data = value;root->left = nullptr;root->right = nullptr;return;}if (value <= root->data)insert(root->left, value);if (value > root->data)insert(root->right, value);
}
void dfs(info* root,int depth)
{if (!root)return;if (minx < depth){minx = depth;}num[depth]++;dfs(root->left, depth + 1);dfs(root->right, depth + 1);
}
int main()
{cin >> n;vector<int>v(n);info* root = nullptr;;for (int i = 0; i < n; i++){cin >> v[i];insert(root, v[i]);}dfs(root, 1);cout << num[minx] << " + " << num[minx - 1] << " = " << num[minx] + num[minx - 1];
}

1115 Counting Nodes in a BST(甲级)相关推荐

PAT甲级1115 Counting Nodes in a BST (30分)：[C++题解] 递归建二叉搜索树、dfs求一层结点数量
文章目录题目分析题目链接题目分析分析首先本题给定的二叉搜索树的定义和其他地方的不同.本题小于等于的是左子树,右子树是大于根结点的. 然后说一下做题的思路. 给定一串数据,让构造二叉搜索树. ...
1115. Counting Nodes in a BST (30) 数据结构
给出一颗BST树求这个数最后两层的节点数量用c1+c2 = n 的形式给出建树深度搜索即可 #include<iostream> #include<cstdio> #in ...
1115 Counting Nodes in a BST
我的DFS void DFS(Node* root){if(root==NULL)return;if(root->lchild){root->lchild->layer = root ...
1115 Counting Nodes in a BST (30 分)【难度: 一般 / 知识点: 构建二叉搜索树】
https://pintia.cn/problem-sets/994805342720868352/problems/994805355987451904 很经典的构建搜索二叉树. #include& ...
Two nodes of a BST are swapped, correct the BST
Two nodes of a BST are swapped, correct the BST[转载] Two of the nodes of a Binary Search Tree (BST) a ...
Two nodes of a BST are swapped, correct the BST（恢复两个节点被交换的BST）
Two nodes of a BST are swapped, correct the BST(恢复两个节点被交换的BST) Q: BST的两个节点被交换了,修复它: Input Tree:10/ \ ...
刷PAT甲级的各题思路、细节以及遇到的问题记录
1001 A+B Format (20分) 因为一定会用到字符串,而string非常好用,但是用的时候一定要注意不能越界访问,否则会在运行时出现abort() has been called. 100 ...
oracle 连接组件,[2021] node连接oracle数据库示例[使用oracle官方组件]
[2021] node连接oracle数据库示例[使用oracle官方组件] node 连接 oracle 示例本示例采用的 oracledb 和 instantclient-basic-windo ...
PAT甲级真题目录（按题型整理）（转自柳神）
转载自:https://www.liuchuo.net/archives/2502?tdsourcetag=s_pcqq_aiomsg 最短路径 1003. Emergency (25)-PAT甲级真 ...

1115 Counting Nodes in a BST(甲级)

1115 Counting Nodes in a BST(甲级)相关推荐

最新文章

热门文章