 Algorithms that manipulate linked lists usually get such handles to the input lists and return the handles to the resulting lists.In fact, in the context of such algorithms, the word "list" often means "list handle".In some situations, however, it may be convenient to refer to a list by a handle that consists of two links, pointing to its first and last nodes.