| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $0$ | 正确数量 | $2$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Binary Search Tree II
Write a program which performs the following operations to a binary search tree T by adding the find operation to A: Binary Search Tree I.
insert k: Insert a node containing k as key into T.
find k: Report whether T has a node containing k.
print: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.
For each find k operation, print "yes" if T has a node containing k, "no" if not.
In addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.
10
insert 30
insert 88
insert 12
insert 1
insert 20
find 12
insert 17
insert 25
find 16
print
yes
no
1 12 17 20 25 30 88
30 12 1 20 17 25 88
The number of operations ≤500,000
The number of print operations ≤10.
−2,000,000,000≤key≤2,000,000,000
The height of the binary tree does not exceed 100 if you employ the above pseudo code.
The keys in the binary search tree are all different.
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$1314 $ms] | 王天驰 | 807851 | 2022-01-21 11:56:24 |
| 内存最少[$14624 $KB] | 王天驰 | 807851 | 2022-01-21 11:56:24 |
| 第一AC | 王天驰 | 807851 | 2022-01-21 11:56:24 |
| 第一挑战 | 王天驰 | 807851 | 2022-01-21 11:56:24 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|