-
Cùng tham gia nhóm của FuOverflow trên Facebook https://www.facebook.com/groups/nvh2fuoverflow
CSD201_-_HCM_-_BST_-_01_3459.webp
Bài viết gốc: Chủ đề 'CSD201 - HCM - BST - 01'
Requirements
f1(): (2.5 points)
To complete the f1 requirement, students need to perform two specific tasks:
Implement the insert() function in the StudentBST structure - insert a new student into the
BST
Implement the addLast() function in the ScholarshipList structure - add a student to the end
of the scholarship list
Expected output to check your code:
Student BST (Inorder Traversal):
(S001, John, 3.8,CS, 100.0) (S002, Mary, 3.5,Business,150.0) (S003, David, 3.9,CS,200.0)
(S004, Sarah,3.2,IT, 120.0) (S005, Michael, 3.7,Engineering, 180.0)
Scholarship List:
(S003, David, 3.9,CS,500.0) (S001, John, 3.8, CS,600.0) (S005, Michael, 3.7,Engineering,450.0)
f1(): (2.5 points)
To complete the f1 requirement, students need to perform two specific tasks:
Implement the insert() function in the StudentBST structure - insert a new student into theBST
Implement the addLast() function in the ScholarshipList structure - add a student to the end
of the scholarship list
Expected output to check your code:
Student BST (Inorder Traversal):
(S001, John, 3.8,CS, 100.0) (S002, Mary, 3.5,Business,150.0) (S003, David, 3.9,CS,200.0)
(S004, Sarah,3.2,IT, 120.0) (S005, Michael, 3.7,Engineering, 180.0)
Scholarship List:
(S003, David, 3.9,CS,500.0) (S001, John, 3.8, CS,600.0) (S005, Michael, 3.7,Engineering,450.0)