Repeat the previous project, but add a dummy node to the chain, as Project 7 describes.
One difficulty with implementing the doubly linked chain described in Segment 11.35 is the number of special cases that occur at the beginning and end of the chain. You can eliminate these cases if the chain is never empty. Thus, you begin each chain with a dummy node that you do not use for data. Revise the implementation of the deque given in this chapter by using a dummy node.
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.