Linked list

From Rosetta Code
Revision as of 15:31, 19 March 2007 by MikeMol (talk | contribs) (Created article. Lots of dead links that need to be created.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A linked list is a data structure which allows a great deal of flexibility in memory allocation and data sorting. Linked lists depend on references for their organization. Each link element contains one or more references to other link elements, as well as data.

There are a few different types of linked lists:

Singly-Linked List

A singly-linked list allows traversal in one direction, forward. To this end, each data element contains a reference to the next data element in the sequence.

See also

Doubly-Linked List

A doubly-linked list allows traversal in two directions, forward and back. To this end, each data element contains references to both the previous and next elements.

See also