☑Kizspy.me
Zoom
a. f1(): To complete requirement f1(), the student needs to implement two methods
addStudent(...) and printinsertion Order(...) in the SIIStudent class to add students to the
Linked List and print out the first 5 students who have paid fees (assume this condition is
satisfied).
Expected result:
(9,V,true) (15,M,true) (12,N,true) (7,A,true) (3,T,true)
b. f2(): To complete requirement f2(), the student needs to implement two methods insert(...)
and insertStudent(...) in the BstStudent class: insert a new node with key = id to the Binary
Search Tree (BST), then implement the count(...) method (also in this class) and call count(...)
in f2() to count the number of students who have not paid fees.
Expected result:
3
c. f3():To complete requirement f3(), the student needs to implement two methods search(...)
and searchByld(...) in the BstStudent class, and then call search(...) in f3() to perform the
requests given in f3():
•
If found: Return the found BstNode containing the Student
Else: Return null
The evnerted innut/outnut used to test your code are as follows
+ 100%
Close
