|
A linked list is a complex data structure, especially useful in systems or applications programming. A linked list is comprised of a series of nodes, each node containing a data element, and a pointer to the next node.
A linked list or one way list is a linear collection of data elements called nodes, where the linear order is given by the means of pointers. That is each node is divided into two parts the first part contain the information of the element, and the second part called the linked field or next pointer field, contain the address of the next node in the list.
Doubly Linked Lists:
Linked lists containing integer values or pointers to data, with the ability to iterate over the list in both directions are called the Doubly Linked Lists.
Each element in the list contains a piece of data, together with pointers which link to the previous and next elements in the list. Using these pointers it is possible to move through the list in both directions (unlike the Singly-Linked Lists which only allows movement through the list in the forward direction).
Circular Linked List:
A linked list whose last node points back to the first node instead of containing the null pointer, called a Circular Linked List. |
