Editing Linked list

The '''linked list''', often referred to simply as a ''list'', is a data structure that organizes a [[sequence]] of objects, all of the same type and size, in memory, so that each element except the last is stored along with the address of the next element. Here addresses are not required to occur in arithmetic progression, unlike in [[array]]s. Lists arise in a natural way in the [[lambda calculus]] and so they are fundamental to most [[functional programming language]]s.

==Terminology==
Each object stored in a linked list is known as an '''element''' or '''value'''. The address of the next value is known as a '''link''', as it "links" the element to the next one. A value and the corresponding link, stored together and taken collectively, are known as a '''node''' of the list. The '''size''' or '''length''' of a linked list is the number of elements or nodes it contains. A list may be empty if it contains no elements. If it is not empty, its first node is known as the '''head''', and the rest of its elements, which themselves form a linked list, are known as the '''tail'''. There are traditionally two functions on a linked list: one that returns the head, known as '''car''', and one that returns the tail, known as '''cdr'''.

==Implementation==
In an [[imperative programming language]], a node of a linked list is typically represented using a record type that contains both the value and a [[pointer]] to the next node; the address of the next node can be recovered from the pointer. A sentinel value, such as a null pointer, is often used for the link field of the last node in the list.

Because the list may be empty, we cannot assume that we can remember "where it is" using the address of its first node. Instead, a linked list usually has a ''head node'' that contains a pointer to the head of the actual list, which will be null when the list actually contains no first element at all. The head node may also store the length of the list and/or the address of the ''last'' element.

===Operations on lists===
In the time bounds quoted below, <math>N</math> refers to the length of the list.
* Lists support efficient sequential traversal of their elements, also known as ''iteration''. For example, suppose we wanted to find the sum of all elements in the list. Then we would start at the first element, add its value to an accumulator, follow the link to the next element, and so on until reaching the end of the list, which gives <math>O(N)</math> time.
* An element may be inserted into a list in <math>O(1)</math> time. Suppose we wished to insert node '''b''' between nodes '''a''' and '''c'''. Then we would set the link of '''b''' to point to '''c''' and set the link of '''a''' to point to '''b''' (it formerly pointed to '''c'''). Contrast this with an array, which requires <math>O(N)</math> time to do the same.
* An element may be deleted from a list in <math>O(1)</math> time; all we have to do is make the link of the previous element point to the next element (this is like "skipping" that element). (A subtlety here, and in a few of the other operations, is that if we are only given the address of the element we wish to delete, we cannot efficiently determine the address of the previous element unless the list is doubly linked; see below.)
* ''Splicing'' refers to two operations. Given a list, a starting node, and an ending node within that list, we can easily remove all elements between the starting and ending node from the list, putting them into a separate list; this only requires changing a few links at the boundaries. We may also take a list and insert the entire thing between two adjacent nodes of another list; again, this only requires changing a few links at the boundaries. These operations both take <math>O(1)</math> time.
:* Special case: Two lists can be concatenated in <math>O(1)</math> time, if we know in advance the address of the last node of the first.
* Lists do ''not'' support efficient random access; if we need to find the 1000<sup>th</sup> element in a list, we will have to start at the first element and follow 999 links to get to the 1000<sup>th</sup>. So random access takes <math>O(N)</math> time. If efficient random access is important, it might be better to use an array; if efficient random access and efficient insertion and removal of elements are both important, it is advisable to use a [[Binary search tree|tree]].

===Doubly linked lists===
In some lists, each node also contains a link that points to the ''previous'' node (except possibly the first node, which may or may not point back to the head node). Doubly linked lists may be efficiently traversed both forward and backward (if the head node contains a pointer to the last element), and allow ''erase'' to be implemented efficiently without foreknowledge of the address of the node preceding the one we wish to erase.