A doubly linked chain, like the one described in Exercise and Figure 1 of Chapter 3, has nodes that each can reference a previous node and a next node. In Chapter 3, the doubly linked chain has only a head reference, but it can have both a head reference and a tail reference, as Figure 2 illustrates.
Exercise
List the steps necessary to add a node to a doubly linked chain when the new node is
a. First in the chain
b. Last in the chain
c. Between existing nodes in the chain.
FIGURE 1 A doubly linked chain for Exercises 2, 3, 4, and 5, and Project 1
![]()
FIGURE 2 A doubly linked chain for Exercises 5 and 6 and Project 1
![]()
Implement a replace method for the class LList that returns the replaced object.
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.