CSD201_-_PE_-_De01_3965.webp

☑Kizspy.me
free (BST), then implement the
hod (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 expected input/output used to test your code are as follows:
Found
Not Found
INPUT:
INPUT:
3
3
7
8
OUTPUT:
OUTPUT:
(7,A,true)
Not found
d. f4(): Print students who have paid fees in descending order of ID. Hint: copy inOrder(...) to
printPaidDesc(...) (given in the BstStudent class) and modify the printPaid Desc(...) method
accordingly, and then call printPaidDesc(...) in f4().
Expected result:
(2,D,false) (3,T,true) (5,B,false) (7,A,true) (9,V,true) (11,P,true) (12,N,true) (15,M,true) (18,H,false)
Zoom
+ 100%
Close