1、 实验名称及学时数
树及其应用 2学时
2、 实验目的
树是一种应用极为广泛的数据结构,也是这门课程的重点。它们的特点在于非线性。广义表本质上是树结构。本章实验继续突出了数据结构加操作的程序设计观点,但根据这两种结构的非线性特点,将操作进一步集中在遍历操作上,因为遍历操作是其他众多操作的基础。遍历逻辑的(或符号形式的)结构,访问动作可是任何操作。本次实验希望帮助学生熟悉各种存储结构的特征,以及如何应用树结构解决具体问题(即原理与应用的结合)。
3、 实验要求
1) 编程实现必做实验内容1)、2)。
2) 学生可根据自己的能力完成选做内容。
3) 填写实验报告(见附件)。
RunID | User | Nick Name | Problem ID | Result | Memory | Time | Language | Code Length | Submit Time |
184620 | 2022211452 | wangshu | Accepted | 2184KB | 2ms | C++ | 1066 bytes | 2023-11-07 14:46:39 | |
184581 | 2022211452 | wangshu | Accepted | 2184KB | 2ms | C++ | 1163 bytes | 2023-11-07 12:36:31 | |
184317 | 2022211452 | wangshu | Accepted | 2176KB | 3ms | C++ | 275 bytes | 2023-11-06 21:04:28 | |
184235 | 2022211452 | wangshu | Accepted | 2176KB | 2ms | C++ | 144 bytes | 2023-11-06 19:33:41 | |
184231 | 2022211452 | wangshu | Output Limit Exceed | 2180KB | 2ms | C++ | 1859 bytes | 2023-11-06 19:31:23 | |
184227 | 2022211452 | wangshu | Memory Limit Exceed | 131088KB | 221ms | C++ | 1254 bytes | 2023-11-06 19:29:32 | |
184223 | 2022211452 | wangshu | Memory Limit Exceed | 131204KB | 187ms | C++ | 2491 bytes | 2023-11-06 19:28:30 | |
184218 | 2022211452 | wangshu | Memory Limit Exceed | 131168KB | 195ms | C++ | 1770 bytes | 2023-11-06 19:25:21 | |
184203 | 2022211452 | wangshu | Memory Limit Exceed | 131168KB | 156ms | C++ | 1468 bytes | 2023-11-06 19:06:53 | |
184201 | 2022211452 | wangshu | Memory Limit Exceed | 131076KB | 154ms | C++ | 1412 bytes | 2023-11-06 19:02:08 | |
184200 | 2022211452 | wangshu | Memory Limit Exceed | 131168KB | 210ms | C++ | 1235 bytes | 2023-11-06 19:00:06 | |
184196 | 2022211452 | wangshu | Memory Limit Exceed | 131172KB | 212ms | C++ | 1236 bytes | 2023-11-06 18:52:43 | |
184184 | 2022211452 | wangshu | Memory Limit Exceed | 131168KB | 199ms | C++ | 1093 bytes | 2023-11-06 18:12:08 | |
184181 | 2022211452 | wangshu | Memory Limit Exceed | 131168KB | 210ms | C++ | 1093 bytes | 2023-11-06 18:10:25 |