java (data structures )

Question 1. (4+3 + 3 = 10 marks) (a) Write the method remove Last for the singly-linked list discussed in the class. The method removes the last node in the list. The singly-linked list maintains the size, the references to the head and tail of the list. [4 marks] void removeLast() { (b) Write statements to insert the node tmp after the node p in the doubly-linked list. Assume that each node has a next and prev data members to hold references to next and previous nodes in the list. [3 marks] tmp D A E p (C) Write a method for the circular singly-linked class that displays all the data elements in the list. Assume that the size of the list is not being maintained. [3 marks]