CSD203_-_PE_-_De01_3966.webp
white_cloud1

CSD203_-_PE_-_De01_3966.webp

☑Kizspy.me
Class SIINode: includes a Student object and a next pointer for linking.
Class BstNode: includes a Student object and left, right pointers for linking.
Class CourseSummary: is the main class of the program, containing:
1) Class SIIStudent: is a Linked List, used to store data and maintain the insertion order
of students as they are added.
2) Class BstStudent: is a Binary Search Tree (BST), allowing retrieval of students in sorted
order (in-order traversal) and ensures that student course completion information can
be searched efficiently.
Students are required to carefully read the provided code segments to fully understand the
relationships between the classes and the functions within each class. The specific task of the test
is to execute the following requirements:
a. f1(): To complete requirement f1(), the student needs to implement two functions
add_student(...) and print_insertion_order(...) in the SIIStudent class to add students to the
Linked List and print out the first 5 students who have completed the course (assuming this
condition is satisfied).
The input and expected output used to test your code are as follows:
INPUT:
m = 9
Zoom
+100%
Close
Chưa có bình luận nào.

Thông tin

Category
CSD203
Thêm bởi
white_cloud1
Ngày thêm
Lượt xem
3,280
Lượt bình luận
0
Rating
0.00 star(s) 0 đánh giá

Share this media

Back
Bên trên Bottom