lete the addLast(...) method above only.
The expected output in the file f1.txt should be the following:
(H,6,7) (C,4,5) (1,5,8)
1
void f2() - Suppose the list contains at least three nodes, delete the third node. The expected output in the file f2.txt should be the following:(D,4,7) (Q,7,6) (A,5,7) (B,9,4) (W,10,9)
(D,4,7) (Q,7,6) (B,9,4) (W,10,9)
void f3() Suppose the list contains at least 3 elements. Swap the first element and the last element of the list. The expected output in the file f3.txt should be the following:
(D,2,6) (E,9,4) (Q,4,5) (R,3,7)
(R,3,7) (E,9,4) (Q,4,5) (D,2,6)
void f4() - Delete all nodes satisfying: weight < 4?The expected output in the f4.txt file should be as follows:
(G,2,5) (H,1,3) (1,3,7) (J,4,5) (F,3,9) (K,5,6) (L,6,8) (X,9,4) (1,7,7)
(J,4,5) (K,5,6) (L,6,8) (X,9,4) (1,7,7)
Zoom
+ 91%
Close
