f2(): (2.5 points)
To complete the f2 requirement, students need to:
• Implement the find HighestGPA() function in the StudentBST structure to find the student with
the highest GPA
Display this student's information
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)
Student with highest GPA: (S003, David, 3.9,CS,200.0)
f3(): (2.5 points)
To complete the f3 requirement, students need to:
Count and display the number of students with GPA greater than or equal to 3.5
• Implement the countByGPA() method in the StudentBST structure
Expected output consists of only a single number (the count of students with GPA > 3.5), for example:
4
f4(): (2.5 points)
To complete the f4 requirement, students need to:
• Implement the removeByld() function in the Scholarship List structure to remove a student
from the scholarship list
• Implement the updateStudentBalance() function in the StudentBST structure to update the
amount in the student's account
FOOVERFLOW.COM
Process scholarships: remove students from the scholarship list and add the scholarship
amount to the student's account in the BST
