04-08-2012, 01:10 PM
Linked List
Linked List.ppt (Size: 431.5 KB / Downloads: 38)
Definition.
A linked list is an arrangement of NODES in which elements can easily be inserted or removed without reallocation or reorganization of the entire structure.
A Linked List is a linear Data structure accessible in sequential manner.
A linked list is a data structure consisting of a group of nodes which together represent a sequence.
Linked List is a dynamic Linear data structure which can be of variable size grow able during execution.
Singly Linked List
A singly linked list is a linked list which only provides links in "one direction".
Once you move forward in a singly linked list, there is no way to go backwards unless you kept your reference/pointer from before.
Doubly Linked List
A data structure in which each element contains pointers to the next and previous elements in the list, thus forming a bidirectional linear list.
A structure which support adding elements to the head, tail and middle of the list.
A structure which not allow circular loops.
Circularly Singly Linked List.
Circular linked list is type of linked list used in data structure where address of 1st node is stored in the link part of last node
In a circularly-linked list, the first and final nodes are linked together.
It is possible in Circularly Linked list to visit to the First node from the last node of the list.