Linked+Lists

A **linked List** consists of a sequence of nodes, each containing data fields and one or two references pointing to the next and/or previous nodes. The difference of a linked list over a conventional array is that the order of the linked items may be different from the order that the data items are stored in memory or on disk, allowing the list of items to be accessed in a different order. There are different kinds of linked lists: singly-linked, doubly-linked, and circularly-linked lists.