Write a reference-based implementation of the ADT two-ended list, which has insertion and deletion operations at both ends of the list,
a. Without a tail reference
b. With a tail 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.