data structure in which there are pointers at the end of each list with leads to the next list
In
computer science, a linked list is one of the fundamental
data structures, and can be used to implement other data structures. It consists of a sequence of
nodes, each containing arbitrary data
fields and one or two
references ("links") pointing to the next and/or previous nodes. The principal benefit of a linked list over a conventional
array is that the order of the linked items may be different from the order that the data items are stored in memory or on disk, allowing the list of items to be traversed in a different order. A linked list is a self-referential datatype because it contains a pointer or link to another datum of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow
random access. Several different types of linked list exist: singly-linked lists, doubly-linked lists, and circularly-linked lists.
See more at Wikipedia.org...
<
programming> A data structure in which each element contains a pointer to the next element, thus forming a linear list.
A doubly linked list contains pointers to both the next and previous elements.
(1995-03-28)
Free Download Now!
