Linked Lists are implemented to overcome drawbacks of sequential data structures. Sequential data structures uses storage memory in an inefficient way. Also have inefficient implementation of insertion and deletion operations.
Linked lists have a chained structure and each component in linked list is called nodes. Each nodes of linked list connected like a train bogies. Each node have 2 sections. The first section is data section and other section is link section. The data section contains the data stored in node and link section contains address of next node. According to the number of nodes the linked lists have divided into 3. The first one is singly linked list which contains one link which has address of next node. The second is doubly linked list which contains two links which has address of previous and next nodes. The third is multiply linked list which have more than two links which points to nodes in linked lists. The another type of linked list is circularly linked list which have a circular structure. In this type of linked list the last node's link points to the first node.
Linked lists have many applications. The most important application is representation of sparse matrix in memory and polynomial addition.
Addition of Polynomial: http://terminalcoders.blogspot.com/2014/08/addition-of-polynomial-linked-list.html
Linked lists have a chained structure and each component in linked list is called nodes. Each nodes of linked list connected like a train bogies. Each node have 2 sections. The first section is data section and other section is link section. The data section contains the data stored in node and link section contains address of next node. According to the number of nodes the linked lists have divided into 3. The first one is singly linked list which contains one link which has address of next node. The second is doubly linked list which contains two links which has address of previous and next nodes. The third is multiply linked list which have more than two links which points to nodes in linked lists. The another type of linked list is circularly linked list which have a circular structure. In this type of linked list the last node's link points to the first node.
Linked lists have many applications. The most important application is representation of sparse matrix in memory and polynomial addition.
Addition of Polynomial: http://terminalcoders.blogspot.com/2014/08/addition-of-polynomial-linked-list.html
