Link list operation in C with example code

Link list:

In computer science, a linked list is a data structure consisting of a group of nodes that together represent a sequence.
Example:

Single Linked list

 Doubly Linked list

Here is a sample project on linked list operation:

#include <stdio.h> #include <stdlib.h> #define TRUE 1 #define FALSE 0 void insertAtBeginning(int n); int delfrmBeginning(void); void printList(void); struct myList{ int data; struct myList *next; }; struct myList *head; int main(void) { int option, num, termination; termination = FALSE; while(TRUE){ printf("\nENTER:\n"); printf(" 1 to insert a new number at the beginning\n"); printf(" 2 to delete a number from beginning of the list\n"); printf(" 3 to display the list\n"); printf(" 4 to quit the program\n"); printf("\nEnter option:"); scanf("%d", &option); switch(option){ case 1: printf("Enter number:"); scanf("%d", &num); insertAtBeginning(num); break; case 2: num=delfrmBeginning(); printf("Deleted number: %d",num); break; case 3: printf("Current status of linked List: "); printList(); break; case 4: termination = TRUE; break; } if(termination){ break; } } return 0; } void insertAtBeginning(int n) { struct myList *temp; temp=(struct myList*)malloc(sizeof (struct myList)); temp->data=n; temp->next=head; head=temp; return; } int delfrmBeginning(void) { int n; struct myList *temp; temp=(struct myList*)malloc(sizeof (struct myList)); n=head->data; temp=head; head=head->next; free(temp); return n; } void printList(void) { struct myList *temp; temp=(struct myList*)malloc(sizeof (struct myList)); temp=head; while(temp!=NULL) { printf("%d->",temp->data); temp=temp->next; } printf("Null\n"); return; }
 Happy coding...

You may like:

 Linked List Operations algorithm                                                           User-defined function