Output in the file f1.txt must be the following:Kizspy. me 5,3) (C,6,5) (D,2,4) (E,7,9) (F,4,-7) (G,-3,2)
void f2() -There are 3 given Cala objects x, y, z in this function. Suppose the list contains at least 3 elements. Write statements to insert x, y and z to the list so that x, y, z will be at positions 1, 4 and 6 (The head's position is 0). Output in the file f2.txt must be the following:(C,9,8) (D,6,3) (E,8,5) (F,5,4) (1,4,9) (1,3,7)
(C,9,8) (X,1,2) (D,6,3) (E,8,5) (1,2,3) (F,5,4) (2,3,4) (1,4,9) (1,3,7)
1
void f3() - Suppose p is the first node having maximum color in the list. Swap the contents of tail and p (thus if p=tail then do nothing). Output in the file f3.txt must be the following:(C,7,6) (D,6,7) (E,3,8) (F,7,9) (G,8,7) (H,4,9) (1,8,3)
(C,7,6) (D,6,7) (E,3,8) (1,8,3) (G,8,7) (H,4,9) (F,7,9)
void f4() --Suppose in the list there is only one node p having owner=D, and there are at least 6 nodes after p. Sort 6 elements after p ascendingly by color. The content of the output file f4.txt must be the following:
(C,9,8) (D,11,12) (E,8,7) (F,1,2) (1,7,9) (J,6,8) (K,5,6) (L,9,8) (M,3,4)(C,9,8) (D,11,12) (F,1,2) (K,5,6) (E,8,7) (J,6,8) (L,9,8) (1,7,9) (M,3,4)
Question 2: (4 marks)
In this question you should complete some methods in BSTree.java file.
TL
Zoom
+ 90%
Close
