In a circular linked chain, the last node references the first node. Commonly, only one external reference—to the last node—is maintained, since the first node is found easily from the last one....

In a circular linked chain, the last node references the first node. Commonly, only one external reference—to the last node—is maintained, since the first node is found easily from the last one. Figure 8-12 in Chapter 8 illustrates such a chain. Modify the class LList, as presented in this chapter, by using a circular linked chain and a tail reference.