Linked list in c
- 2. Linked List What is a Linked List? A Linked List is a data structure which is a collection of nodes and each node contains data items and a pointer, popularly called Link which Points to the next node. Distinguish between an Array and a Linked List Array is fixed size whereas Linked List is dynamic sized. Limitations of Array Fixed in dimension, Chance of memory loss, cost of insertion and deletion of an element is costly. Advantages of Linked List: Dynamic memory allocation, cost of inserting and deleting is less.
- 3. Pictorial Representation of Linked List
- 4. Operations on Linked List Creation Insertion Deletion Traversing Searching
- 5. Types of Linked List Singly Linked List Circular Linked List Doubly Linked List
- 6. Linked List as Structure struct Node { int data; struct Node *next; };
- 7. Creating Nodes struct Node* head = NULL; struct Node* second = NULL; struct Node* third = NULL; head = (struct Node*)malloc(sizeof(struct Node)); second = (struct Node*)malloc(sizeof(struct Node)); third = (struct Node*)malloc(sizeof(struct Node));
- 8. Populate nodes and Linking of nodes head->data=1; head->next=second; second->data=2; second>next=third; third->data=3; third->next=NULL;
- 9. Traversing the Linked List void printList(struct Node* n) { while (n != NULL) { printf(" %d ", n->data); n = n->next; } } //printList(head);
- 10. Insertion in Linked List Insertion at the beginning Insertion in between nodes Insertion at the end
- 11. Insertion in a Singly Linked List 34 56 67 78 INSERTION NULL HEAD
- 12. Deletion in Singly Linked List
- 13. Insertion in Circular List
- 14. Deletion in Circular Linked List
- 15. Insertion in Doubly Linked List
- 16. Deletion in Doubly Linked List
- 17. Running time for some Linked List Operations