Consider a linked list of items diat are in no particular order.
a. Write a method that inserts a node at the beginning of the linked list and a method that deletes the first node of the linked list.
b. Repeat Part a, but this time perform the insertion and delcdon at the end of the list instead of at the beginning. Assume the list has only a head reference.
c. Repeat Part A but this time assume that the list has a tail reference as well as a head reference.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.