Linked List
A linked list is nearly the simplest of data structures. Lists are built of nodes that are hooked up to each other - usually there is at least a data field and a pointer field in each node. The pointer field points to the next node in the list, and the last node points to Nil or the start of the list if the list is circular.
An example of a linked list:
Address |
Data |
Pointer |
0100 |
A |
0200 |
0200 |
B |
0300 |
0300 |
C |
0500 |
0500 |
D |
0400 |
0400 |
E |
0100 |
Nodes in a linked list do not have to have ordered addresses, so linked lists can grow freely and allow for manipulations such as insertion and combination easily. One of the most flexible data structures, but has poor search time and the necessary overhead of the Pointer field might be considered too inefficient for certain applications.
Related Data Structures
Related Algorithms
None yet.
Sample Implementations
None yet.
Online Resources
None yet.