1115. Counting Nodes in a BST (30)-PAT甲级真题（二叉树的遍历，dfs）

柳婼

已于 2023-11-09 18:07:41 修改

阅读量2.2k

点赞数 2

文章标签： PAT

于 2016-08-16 00:01:45 首次发布

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/liuchuo/article/details/52216085

版权

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 ea

最低0.47元/天解锁文章

博客等级

码龄9年

1632
原创

8624
点赞

9990
收藏

1万+
粉丝

关注

私信

热门文章

最新评论

1076. Wifi密码 (15)-PAT乙级真题
柠石榴: 没有柳神这么强的思路，还是用的n [code=cpp] #include<bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; cin.ignore(); while (n --){ string s; getline(cin, s); for (int i = 0; i < s.size(); i ++) if (s[i] == 'T') cout << s[i - 2] - 'A' + 1; } return 0; } [/code]
PAT 1067. 试密码(20)-乙级
柠石榴: [code=cpp] #include<bits/stdc++.h> using namespace std; int main(){ string s,t; int n; cin >> s >> n; cin.ignore(); for (int i = 1; ; i ++) { getline(cin, t); if (t == "#") break; else if (t == s){ cout << "Welcome in" << endl; break; } else{ cout << "Wrong password: " << t << endl; if (i == n){ cout << "Account locked" << endl; break; } } } return 0; } [/code]
1115 裁判机 – PAT乙级真题
夜一森: difficult
1039. 到底买不买（20）-PAT乙级真题
柠石榴: 用的哈希表，不过思路跟柳神一样 [code=cpp] #include<bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; map<char,int> mp; for (int i = 0; i < s1.size(); i ++) mp[s1[i]] ++; int sum = 0; for (int i = 0; i < s2.size(); i ++) if (mp[s2[i]] != 0) mp[s2[i]] --; else sum ++; if (sum == 0) cout << "Yes" << " " << s1.size() - s2.size() << endl; else cout << "No" << " " << sum << endl; return 0; } [/code]
浮点错误的意思-PAT 、OJ
金秋飞雪: 阿里嘎多！！！

最新文章

目录

评论 2

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

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