void f4() - How many Phones are there in the list satisfying price>5? The expected output in the file f4.txt should be as follows:
(H,1,3) (1,3,7) (J,4,5) (K,5,6)
2
void f5() - Delete the first node, then sort the elements descending by weight (assuming that all weights are different). The expected output in the file f5.txt should be the following:(N,6,1)-(A,9,3) (W,5,2) (S,7,5) (C,1,1)
(A,9,3) (S,7,5) (W,5,2) (C,1,1)
Question 2: (5 marks)
In this question you should complete some methods in BSTree.java file.
The class Dog (with 3 data members: place, weight and color) is given and you do not need to edit it. The BSTree class is a binary search tree of Dog objects. The variable weight is the key of the BSTree. In this test, these values (weight) must be unique. The following methods should be completed:
Zoom
100%
Close
