0% found this document useful (0 votes)

11 views127 pages

Exp6 Shivansh

The document outlines a lab experiment for implementing a singly linked list in C, detailing the problem statement, program structure, and various operations such as insertion, deletion, sorting, and displaying the list. It includes a complete C program with functions for each operation and a main menu for user interaction. The lab is part of the Data Structures course for the academic year 2024-2025.

Uploaded by

satyamkumarpatel2007

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

11 views127 pages

Exp6 Shivansh

Uploaded by

satyamkumarpatel2007

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 127

Department of Humanities and Applied Science

Academic Year: 2024 - 2025 Name of Student: Shivansh Shukla

Semester: II Student ID: 24107019

Class / Branch: F.E /I Date of Performance: 03.03.25

Subject: Data structures Lab Date of Submission: 03.03.25

Name of Instructor: Prof. Priti farkhade

Experiment No.6

AIM:Implementation of Singly Linked List

PROBLEM STATEMENT: Given a set of integer values as data items, write a C program to implement a singly linked list and perform operations of insertion, deletion sorting and display.

PROGRAM:

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

}EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

}EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

{EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

EXPERIMENT 6

#include<stdio.h>

#include<stdlib.h>

#include<malloc.h>

struct node

int data;

struct node *next;

};

struct node *start=NULL;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

int main()

int option;

printf("\n\n MAIN MENU");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n 13.EXIT");

printf("\n\n Enter your option:");

scanf("%d",&option);

switch(option)

case 1: start=create_ll(start);

printf("\n LINKED LIST CREATED");

break;

case 2: start=display(start);

break;

case 3: start=insert_beg(start);

break;

case 4: start=insert_end(start);

break;

case 5: start=insert_before(start);

break;

case 6: start=insert_after(start);

break;

case 7: start=delete_beg(start);

break;

case 8: start=delete_end(start);

break;

case 9: start=delete_node(start);

break;

case 10:start=delete_after(start);

break;

case 11:start=delete_list(start);

printf("\n LINKED LIST DELETED");

break;

case 12:start=sort_list(start);

break;

}while(option!=13);

return 0;

struct node create_ll(struct node start)

struct node new_node,ptr;

int num;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

scanf("%d",&num);

while(num!=-1)

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

if(start==NULL)

new_node->next=NULL;

start=new_node;

else

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

new_node->next=NULL;

printf("\n Enter the data:");

scanf("%d",&num);

return start;

struct node display(struct node start)

struct node *ptr;

ptr=start;

while(ptr!=NULL)

{ printf("\t %d",ptr->data);

ptr=ptr->next;

return start;

struct node insert_beg(struct node start)

struct node *new_node;

int num;

printf("\n Enter the data :");

scanf("%d",&num);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=start;

start=new_node;

return start;

struct node insert_end(struct node start)

struct node ptr,new_node;

int num;

printf("\n Enter the data:");

scanf("%d",&num);

new_node=(struct node *)malloc(sizeof(struct node));

new_node->data=num;

new_node->next=NULL;

ptr=start;

while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=new_node;

return start;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n Enter the data:");

scanf("%d",&num);

printf("\n Enter the value before which the data has to be inserted :");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

while(ptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

int num,val;

printf("\n enter the data:");

scanf("%d",&num);

printf("\n Enter the value after which the data has to be inserted:");

scanf("%d",&val);

new_node=(struct node*)malloc(sizeof(struct node));

new_node->data=num;

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=new_node;

new_node->next=ptr;

return start;

struct node delete_node(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value of the node which has to be deleted:");

scanf("%d",&val);

ptr=start;

if(ptr->data==val)

start=delete_beg(start);

return start;

else

while(ptr->data!=val)

preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_beg(struct node start)

struct node *ptr;

ptr=start;

start=start->next;

free(ptr);

return start;

struct node delete_end(struct node start)

struct node ptr,preptr;

ptr=start;

while(ptr->next!=NULL)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=NULL;

free(ptr);

return start;

struct node delete_after(struct node start)

struct node ptr,preptr;

int val;

printf("\n Enter the value after which the node has to be deleted:");

scanf("%d",&val);

ptr=start;

preptr=ptr;

while(preptr->data!=val)

{ preptr=ptr;

ptr=ptr->next;

preptr->next=ptr->next;

free(ptr);

return start;

struct node delete_list(struct node start)

struct node *ptr;

if(start!=NULL)

ptr=start;

while(ptr!=NULL)

printf("\n %d is to be deleted next",ptr->data);

start=delete_beg(ptr);

ptr=start;}

return start;

struct node sort_list(struct node start)

struct node ptr1,ptr2;

int temp;

ptr1=start;

while(ptr1->next!=NULL)

ptr2=ptr1->next;

while(ptr2!=NULL)

if((ptr1->data)>(ptr2->data))

temp=ptr1->data;

ptr1->data=ptr2->data;

ptr2->data=temp;

ptr2=ptr2->next;

ptr1=ptr1->next;

return start;

OUTPUT:

CONCLUSION: Hence, we have implemented a C program to implement a singly linked list and perform operations of insertion,

deletion sorting and display.

MCA - First - Year - Detailed - Syllabus - 2024-25
No ratings yet
MCA - First - Year - Detailed - Syllabus - 2024-25
33 pages
Datastructures Lab Programs
100% (5)
Datastructures Lab Programs
70 pages
Memory Layout of C Programs
No ratings yet
Memory Layout of C Programs
5 pages
Program For Implementation of Operations On Circular Linked List
No ratings yet
Program For Implementation of Operations On Circular Linked List
22 pages
Data Structure Manual
No ratings yet
Data Structure Manual
41 pages
Apna College
No ratings yet
Apna College
72 pages
Data Structure Diu All Lab Report
No ratings yet
Data Structure Diu All Lab Report
27 pages
DS LAB Observation
No ratings yet
DS LAB Observation
79 pages
Red Hat Linux 2.1 Virtual Memory Guide
No ratings yet
Red Hat Linux 2.1 Virtual Memory Guide
10 pages
Kmit DS Through C LAB
No ratings yet
Kmit DS Through C LAB
54 pages
DSA Prarit Arora-1
No ratings yet
DSA Prarit Arora-1
51 pages
B22IT031 DS Assignment 2
No ratings yet
B22IT031 DS Assignment 2
18 pages
02 Linked List
No ratings yet
02 Linked List
31 pages
C Programming
100% (1)
C Programming
148 pages
DS Lab 4
No ratings yet
DS Lab 4
9 pages
Data Structures for B.Tech Students
No ratings yet
Data Structures for B.Tech Students
33 pages
DSA Program File1
No ratings yet
DSA Program File1
76 pages
UG ECE 2023 Scheme and Syllabus
No ratings yet
UG ECE 2023 Scheme and Syllabus
167 pages
DS Program
No ratings yet
DS Program
16 pages
Day16 Assignment
No ratings yet
Day16 Assignment
15 pages
Data Structures Lab Manual Modified
No ratings yet
Data Structures Lab Manual Modified
87 pages
Kesha Shah Resume
No ratings yet
Kesha Shah Resume
3 pages
CS162 - 1
No ratings yet
CS162 - 1
22 pages
C Questions:: Answers
100% (1)
C Questions:: Answers
23 pages
Data Structures - LAB-R18
No ratings yet
Data Structures - LAB-R18
78 pages
DSA File
No ratings yet
DSA File
72 pages
LList
No ratings yet
LList
4 pages
Linked Lists: Representation
No ratings yet
Linked Lists: Representation
26 pages
Circular Linked List (Code)
No ratings yet
Circular Linked List (Code)
4 pages
KV Dsa Print
No ratings yet
KV Dsa Print
48 pages
Data Structures LAB Manual
No ratings yet
Data Structures LAB Manual
76 pages
Data Structures & Algorithms Lab
No ratings yet
Data Structures & Algorithms Lab
51 pages
Ds Lab Manual-1 - Merged
No ratings yet
Ds Lab Manual-1 - Merged
85 pages
JAVA MCQ (Answers) - 2
No ratings yet
JAVA MCQ (Answers) - 2
7 pages
Linked List
No ratings yet
Linked List
65 pages
List - Array and Pointer Implementation 15
No ratings yet
List - Array and Pointer Implementation 15
22 pages
Dynamic Memory Allocation: UNIT-1
No ratings yet
Dynamic Memory Allocation: UNIT-1
44 pages
Docfile
No ratings yet
Docfile
44 pages
Linked List
No ratings yet
Linked List
11 pages
9842 DSA Exp3
No ratings yet
9842 DSA Exp3
7 pages
Data Structures Lab
No ratings yet
Data Structures Lab
52 pages
Singly Linked List Program
No ratings yet
Singly Linked List Program
6 pages
Lab 1
No ratings yet
Lab 1
92 pages
Linked List
No ratings yet
Linked List
6 pages
Dsa Exp 5
No ratings yet
Dsa Exp 5
15 pages
Single Linked List
No ratings yet
Single Linked List
6 pages
9818 Dsa Exp2
No ratings yet
9818 Dsa Exp2
12 pages
Dsuc Assignment 2
No ratings yet
Dsuc Assignment 2
40 pages
Ctsdlabmanual Dhairya
No ratings yet
Ctsdlabmanual Dhairya
32 pages
CS50x Lecture 4: Pointers & Memory
No ratings yet
CS50x Lecture 4: Pointers & Memory
32 pages
Data Structure Lab Manual Naresh
No ratings yet
Data Structure Lab Manual Naresh
72 pages
Circular Linked List Guide
No ratings yet
Circular Linked List Guide
21 pages
Exp No: Date
No ratings yet
Exp No: Date
56 pages
DS Lab PGM
No ratings yet
DS Lab PGM
43 pages
ALOK KUMAR Roll-70
No ratings yet
ALOK KUMAR Roll-70
13 pages
Seating Plan - 24 Feb25 - Sem II - UT 1
No ratings yet
Seating Plan - 24 Feb25 - Sem II - UT 1
2 pages
Exp 6 - Dsa Lab File
No ratings yet
Exp 6 - Dsa Lab File
38 pages
C Programming: Arrays & Lists
No ratings yet
C Programming: Arrays & Lists
33 pages
CS 212L Data Structures & Algorithms Lab 02 Handout: Rachna College of Engineering & Technology, Gujranwala
No ratings yet
CS 212L Data Structures & Algorithms Lab 02 Handout: Rachna College of Engineering & Technology, Gujranwala
3 pages
Practical File Vandu
No ratings yet
Practical File Vandu
27 pages
Practical File Nushcloak
No ratings yet
Practical File Nushcloak
29 pages
Pointers and Memory
No ratings yet
Pointers and Memory
23 pages
It0501 Data Structures and Algorithms Lab Manual
No ratings yet
It0501 Data Structures and Algorithms Lab Manual
54 pages
Mechatronics Programming Guide
No ratings yet
Mechatronics Programming Guide
100 pages
Assignment Tutorial
No ratings yet
Assignment Tutorial
1 page
Circular Singly Link List
No ratings yet
Circular Singly Link List
3 pages
Data Structure Lab Manual
No ratings yet
Data Structure Lab Manual
28 pages
Sheet Metal Shop Assignment No. 2
No ratings yet
Sheet Metal Shop Assignment No. 2
8 pages
Data Structure LabManual GECP Manish Yadav345!33!67
No ratings yet
Data Structure LabManual GECP Manish Yadav345!33!67
35 pages
Data Structure Lab Manual
No ratings yet
Data Structure Lab Manual
24 pages
EduSkills Internship 02 11 2024
No ratings yet
EduSkills Internship 02 11 2024
32 pages
PPL Experiment No-4
No ratings yet
PPL Experiment No-4
9 pages
B.Tech Data Structures Assignment
No ratings yet
B.Tech Data Structures Assignment
2 pages
AICTE Internship
No ratings yet
AICTE Internship
1 page
TCS Technical Interview Questions and Answers Updated On Dec 2019
No ratings yet
TCS Technical Interview Questions and Answers Updated On Dec 2019
11 pages
C/c++questions With Answers
No ratings yet
C/c++questions With Answers
14 pages
C/C++ Cheatsheet Documentation: Release 0.1.0
No ratings yet
C/C++ Cheatsheet Documentation: Release 0.1.0
202 pages
Linked List Advantages Over Array
No ratings yet
Linked List Advantages Over Array
15 pages
CSE242 DataStructures
No ratings yet
CSE242 DataStructures
5 pages
It-353 Experiment File: Submitted By: Samruddhi Kadam (2K19/Ae/052) (G1) Submitted To: Prof. Ruchi Holker
No ratings yet
It-353 Experiment File: Submitted By: Samruddhi Kadam (2K19/Ae/052) (G1) Submitted To: Prof. Ruchi Holker
16 pages
C Programming Essentials Guide
No ratings yet
C Programming Essentials Guide
2 pages
Data Stuture Record
No ratings yet
Data Stuture Record
109 pages
CSC211, Hand Outs
No ratings yet
CSC211, Hand Outs
107 pages
DSA Notes
No ratings yet
DSA Notes
145 pages
(LECTURE 2) Advanced C Programming
No ratings yet
(LECTURE 2) Advanced C Programming
48 pages
A37-Assignment 8
No ratings yet
A37-Assignment 8
10 pages
java ôn tập
No ratings yet
java ôn tập
92 pages
A Static Load-Balancing Scheme For Parallel XML Parsing On Multicore Cpus
No ratings yet
A Static Load-Balancing Scheme For Parallel XML Parsing On Multicore Cpus
10 pages
Building - Your.own - Memory.manager - For.c C.projects
No ratings yet
Building - Your.own - Memory.manager - For.c C.projects
26 pages
0x11 MemoryLayout
No ratings yet
0x11 MemoryLayout
27 pages
PHK Malloc Paper
No ratings yet
PHK Malloc Paper
6 pages
Quick Heal Placement Paper February 2012
No ratings yet
Quick Heal Placement Paper February 2012
2 pages
Virtual Function: Chapter Contents
No ratings yet
Virtual Function: Chapter Contents
12 pages

Exp6 Shivansh

Uploaded by

Exp6 Shivansh

Uploaded by

￼

Department of Humanities and Applied Science

Semester: II Student ID: 24107019

Class / Branch: F.E /I Date of Performance: 03.03.25

Subject: Data structures Lab Date of Submission: 03.03.25

Name of Instructor: Prof. Priti farkhade

AIM:Implementation of Singly Linked List

struct node *next;

struct node *start=NULL;

struct node *create_ll(struct node *);

struct node *display(struct node *);

struct node *insert_beg(struct node *);

struct node *insert_end(struct node *);

struct node *insert_before(struct node *);

struct node *insert_after(struct node *);

struct node *delete_beg(struct node *);

struct node *delete_end(struct node *);

struct node *delete_node(struct node *);

struct node *delete_after(struct node *);

struct node *delete_list(struct node *);

struct node *sort_list(struct node *);

printf("\n\n ****MAIN MENU****");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n\n Enter your option:");

printf("\n LINKED LIST CREATED");

printf("\n LINKED LIST DELETED");

struct node *create_ll(struct node *start)

struct node *new_node,*ptr;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

new_node=(struct node*)malloc(sizeof(struct node));

struct node *next;

struct node *start=NULL;

struct node *create_ll(struct node *);

struct node *display(struct node *);

struct node *insert_beg(struct node *);

struct node *insert_end(struct node *);

struct node *insert_before(struct node *);

struct node *insert_after(struct node *);

struct node *delete_beg(struct node *);

struct node *delete_end(struct node *);

struct node *delete_node(struct node *);

struct node *delete_after(struct node *);

struct node *delete_list(struct node *);

struct node *sort_list(struct node *);

printf("\n\n ****MAIN MENU****");

printf("\n 1.Create a list");

printf("\n 2.Display the list");

printf("\n 3.Add a node at the beginning");

printf("\n 4.Add a node at the end");

printf("\n 5.Add a node before a given node");

printf("\n 6.Add a node after a given node");

printf("\n 7.Add a node from the beginning");

printf("\n 8.Delete a node from the end");

printf("\n 9.Delete a given node");

printf("\n 10.Delete a node after a given node");

printf("\n 11.Delete the entire list");

printf("\n 12.Sort the list");

printf("\n\n Enter your option:");

printf("\n LINKED LIST CREATED");

printf("\n LINKED LIST DELETED");

struct node *create_ll(struct node *start)

struct node *new_node,*ptr;

printf("\n Enter -1 to end");

printf("\n Enter the data:");

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

printf("\n\n MAIN MENU");

struct node create_ll(struct node start)

struct node new_node,ptr;

struct node create_ll(struct node );

struct node display(struct node );

struct node insert_beg(struct node );

struct node insert_end(struct node );

struct node insert_before(struct node );

struct node insert_after(struct node );

struct node delete_beg(struct node );

struct node delete_end(struct node );

struct node delete_node(struct node );

struct node delete_after(struct node );

struct node delete_list(struct node );

struct node sort_list(struct node );

printf("\n\n MAIN MENU");

struct node create_ll(struct node start)

struct node new_node,ptr;

struct node display(struct node start)

struct node insert_beg(struct node start)

struct node insert_end(struct node start)

struct node ptr,new_node;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

struct node delete_node(struct node start)

struct node ptr,preptr;

struct node delete_beg(struct node start)

struct node delete_end(struct node start)

struct node ptr,preptr;

struct node delete_after(struct node start)

struct node ptr,preptr;

struct node delete_list(struct node start)

struct node sort_list(struct node start)

struct node ptr1,ptr2;

struct node display(struct node start)

struct node insert_beg(struct node start)

struct node insert_end(struct node start)

struct node ptr,new_node;

struct node insert_before(struct node start)

struct node new_node,ptr,*preptr;

struct node insert_after(struct node start)

struct node new_node,ptr,*preptr;

struct node delete_node(struct node start)

struct node ptr,preptr;

struct node delete_beg(struct node start)

struct node delete_end(struct node start)

struct node ptr,preptr;

struct node delete_after(struct node start)

struct node ptr,preptr;

struct node delete_list(struct node start)

struct node sort_list(struct node start)

struct node ptr1,ptr2;

struct node create_ll(struct node );