Refer to Chapter12 LList. Adding nodes to or removing nodes from a linked chain requires a special case when the operation is at the beginning of the chain. To eliminate this special case, you can add...

Java

Extracted text: Refer to Chapter12 LList. Adding nodes to or removing nodes from a linked chain requires a special case when the operation is at the beginning of the chain. To eliminate this special case, you can add a dummy node at the beginning of the chain. the dummy node is always present but does not contain a list entry. The chain then is never empty and so the head reference is never null, even when the list is empty. Modify the class LList as presented in that chapter, by adding the dummy node to the chain. Test your implementation.