Implement and test a class of lists using a doubly linked chain, as shown in Figure 4, to represent the entries in the list. Use an inner class of nodes like the one that Exercise 12 of Chapter 3 asked you to define, but include set and get methods.
FIGURE 4 A doubly linked chain for Exercises 5 and 6 and Project 1
![]()
Exercise 12
In a doubly linked chain, each node can reference the previous node as well as the next node. Figure 5 shows a doubly linked chain and its head reference. Define a class to represent a node in a doubly linked chain. Write the class as an inner class of a class that implements the ADT bag. You can omit set and get methods.
FIGURE 5 A doubly linked chain for Exercises 2, 3, 4, and 5, and Project 1

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.