Insertion of a new entry before or after any element in the list. Removal of any entry in the list. Forward traversal through the list.
Lists are the simplest of the three data structures and support only the above functionality.
Entries can be added at the end of a list. All list insertions and removals, except insertion before an- other element, must specify the head of the list. Each head entry requires two pointers rather than one. Entries can be added at the end of a list. They may be traversed backwards, from tail to head.