Linked List

Linked list is a data structure consists of series of nodes.  Each node consists a data and a pointer to the next node.  And the reference from the last node points to NULL.  And it can be used to implement stacks, queue, etc.

Structure of a node:
struct node {
int data;
struct node *ptr;
};

                              ..................................
                             |      data       |       ptr       |
                              ..................................
                                                node

Basic Operations In Linked List:
insert()       - insert a new node into the linked list
delete()      - delete a node from the linked list
isEmpty()    - List is empty or not
isFirst()       - given data is in first node of linked list or not
isLast()       - given data is at the last node or not
first()         - gets the data in first node
last()          - gets the data in last node
deleteList() - delete entire list

Types of Linked List:
1.  Singly Linked List
2.  Doubly Linked List
3.  Circular Linked List

See Also:

C Program To Merge Two Arrays
C Program For Array Representation Of Sparse Matrix
C Program To Perform Insertion, Deletion, Searching & Traversal In Singly Linked List
C Program To Perform Insertion, Deletion, Sorting In Doubly Linked List - (Simple)
C Program To Sort A Doubly Linked List (Descending Order)

C Program To Merge Two Linked Lists

C Program To Reverse Linked List
C Program To Implement Circular Singly Linked List
C Program To Implement Circular Doubly Linked List
C Program For Polynomial Multiplication Using Linked List 
C Program For Polynomial Addition Using Linked List
C Program For Linked List Representation Of Sparse Matrix
C Program To Concatenate Two Linked Lists
C Program To Perform Recursion On Linked List

Insertion, Deletion, Traversal, Reversal And Search Operation on Arrays
Doubly Linked List - Insertion, Traversal, Searching, Delete Node, Delete List