Difference between revisions of "Linked data structure"

Latest revision as of 17:26, 9 May 2016

In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers).

The link between data can also be called a connector.

Description

In linked data structures, the links are usually treated as special data types that can only be dereferenced or compared for equality.

Linked data structures are thus contrasted with arrays and other data structures that require performing arithmetic operations on pointers.

This distinction holds even when the nodes are actually implemented as elements of a single array, and the references are actually array indices: as long as no arithmetic is done on those indices, the data structure is essentially a linked one.

Linking can be done in two ways:

• Dynamic allocation
• Array index linking

Linked data structures include many other widely used data structures:

• Linked lists
• Search trees
• Expression trees

They are also key building blocks for many efficient algorithms, such as topological sort and set union-find.

See also

• Data record (computer science)
• Expression tree
• Linked list
• List of data structures
• Pointer (computer programming)
• Reference (computer science)
• Search tree

External links

• Linked data structure @ Wikipedia