Set of data records (nodes) linked together and organized by references (links or pointers)
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.
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 – using dynamic allocation and using array index linking.
Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort[1] and set union-find.[2]
^Donald Knuth, The Art of Computer Programming
^Bernard A. Galler and Michael J. Fischer. An improved equivalence algorithm. Communications of the ACM, Volume 7, Issue 5 (May 1964), pages 301–303. The paper originating disjoint-set forests. ACM Digital Library
and 19 Related for: Linked data structure information
In computer science, a linkeddatastructure is a datastructure which consists of a set of data records (nodes) linked together and organized by references...
In computing, linkeddata is structureddata which is interlinked with other data so it becomes more useful through semantic queries. It builds upon standard...
linked lists. Linked lists are among the simplest and most common datastructures. They can be used to implement several other common abstract data types...
is a list of well-known datastructures. For a wider list of terms, see list of terms relating to algorithms and datastructures. For a comparison of running...
linked list is a linkeddatastructure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields...
In computing, a persistent datastructure or not ephemeral datastructure is a datastructure that always preserves the previous version of itself when...
The datalink layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers...
A data model explicitly determines the structure of data; conversely, structureddata is data organized according to an explicit data model or data structure...
A datastructure diagram (DSD) is the visual representation of a certain kind of data model that contains entities, their relationships, and the constraints...
minerals and chemicals. Abstract structures include datastructures in computer science and musical form. Types of structure include a hierarchy (a cascade...
functional datastructure is a datastructure that can be directly implemented in a purely functional language. The main difference between an arbitrary data structure...
possible operations on data of this type, and the behavior of these operations. This mathematical model contrasts with datastructures, which are concrete...
algorithms and datastructures. For algorithms and datastructures not necessarily mentioned here, see list of algorithms and list of datastructures. This list...
process of translating a datastructure or object state into a format that can be stored (e.g. files in secondary storage devices, data buffers in primary storage...
individuals. Web resources, such as web pages and more formally structuredlinkeddata, frequently include links to other resources across the web, and...
In computer science, a search datastructure[citation needed] is any datastructure that allows the efficient retrieval of specific items from a set of...
Global Information