SINGLY LINK LIST

DOWNLOAD FULL PROGRAME

CODING:

#CREATE A LIST
struct node *creatlist(struct node *start)
{
struct node *new_node;
int num;
printf("\nENTER '-1' FOR SAVE THE LIST.");
printf("\nEnter The Number:");
scanf("%d",&num);
while(num!=-1)
{
new_node=(struct node*)malloc(sizeof(struct node*));
new_node->no=num;
if(start==NULL)
{
  new_node->next=NULL;
  start=new_node;
  cu++;
}
else
{
  new_node->next=start;
  start=new_node;
  cu++;
}
printf("Enter The Number:");
scanf("%d",&num);
}
return start;
}
#TRAVERSAL
struct node *display(struct node *start)
{
struct node *ptr;
ptr=start;
printf("\nLIST OPEN...\n");
while(ptr!=NULL)
{
  printf("\n %d",ptr->no);
  ptr=ptr->next;
}
return start;
}
#INSERT AT FIRST
struct node *inserrecord(struct node *start)
{
int no;
struct node *new_record;
printf("\nEnter The Number:");
scanf("%d",&no);
new_record=(struct node*)malloc(sizeof(struct node));
new_record->no=no;
new_record->next=start;
start=new_record;
cu++;
return start;
}
#DELETE FROM FIRST
struct node *deletebeg(struct node *start)
{
struct node *ptr;
ptr=start;
start=start->next;
free(ptr);
cu--;
return start;
}
#INSERT AT LAST
struct node *insertlast(struct node *start)
{
struct node *ptr,*new_record;
int num;
printf("\nEnter The Number:");
scanf("%d",&num);
new_record=(struct node *)malloc(sizeof(struct node));
ptr=start;
new_record->no=num;
while(ptr->next!=NULL)
ptr=ptr->next;
ptr->next=new_record;
new_record->next=NULL;
cu++;
return start;
}
#DELETE FROM LAST
struct node *deletelast(struct node *start)
{
struct node *ptr,*last;
ptr=start;
while(ptr->next!=NULL)
{
 last=ptr;
 ptr=ptr->next;
}
last->next=NULL;
free(ptr);
cu--;
return start;
}
#INSERT AT SPECIFIED LOCATION(BEFORE OR AFTER THE NODE)
#BEFORE
struct node *insertbefore(struct node *start)
{
struct node *ptr,*new_node,*preptr;
int num,no;
printf("\nEnter The Before Number of Added In List:");
scanf("%d",&no);
if(start->no==no)
{
start=inserrecord(start);
}
else
{
printf("\nEnter The Number:");
scanf("%d",&num);
ptr=start;
new_node=(struct node *)malloc(sizeof(struct node));
new_node->no=num;
while(ptr->no!=no)
{
  preptr=ptr;
  ptr=ptr->next;
}
new_node->next=ptr;
preptr->next=new_node;
}
return start;
}
#AFTER
struct node *ptr,*preptr,*new_node;
int no,num;
printf("\nEnter The Number:");
scanf("%d",&num);
printf("\nEnter The After Number of Added In List:");
scanf("%d",&no);
new_node= (struct node *)malloc(sizeof(struct node));
new_node->no=num;
ptr=start;
while(preptr->no!=no)
{
   preptr=ptr;
   ptr=ptr->next;
}
new_node->next=ptr;
preptr->next=new_node;
return start;
}
#DELETE ANY SPECIFIED NODE
struct node *deletenode(struct node *start)
{
struct node *ptr,*preptr;
int num;
printf("Enter The Number:");
scanf("%d",&num);
ptr=start;
if(ptr->no==num)
{
  start=deletebeg(start);
  return start;
}
else
{
 while(ptr->no!=num)
 {
   preptr=ptr;
   ptr=ptr->next;
 }
}
preptr->next=ptr->next;
free(ptr);
cu--;
return start;
}
#SORTING
struct node *sort(struct node *start)
{
struct node *ptr1,*ptr2;
int temp;
ptr1=start;
while(ptr1->next!=NULL)
{
 ptr2=ptr1->next;
 while(ptr2!=NULL)
 {
  if(ptr1->no>ptr2->no)
  {
   temp=ptr1->no;
   ptr1->no=ptr2->no;
   ptr2->no=temp;
  }
   ptr2=ptr2->next;
 }
ptr1=ptr1->next;
}
return start;
}
#SPLITTING
struct node *split(struct node *start)
{
int i;
struct node *s;
if(flag==0)
{
printf("Enter The Position of Split:");
scanf("%d",&i);
s=start;
while(i>1)
{
s=s->next;
i--;
}
splitlist=s->next;
s->next=NULL;
s=start;
flag=1;
printf("\n->Your List is Splitted.");
}
else{printf("SORRY,Your List is Already Splitted");}
return start;
}
#MERGING
struct node *merge(struct node *start)
{
struct node *ptr;
ptr=start;
if(flag==0)
{
printf("SORRY,You have note Splitted List.");
}
else
{
while(ptr->next!=NULL)
ptr=ptr->next;
ptr->next=splitlist;
flag=0;
printf("->Your List Merged.");
}
return start;
}
#COUNTING OPERATIONS(TOTAL NO. OF NODES,EVEN AND ODD)
struct node *count(struct node *start)
{
struct node *ptr;
int odd=0,even=0;
ptr=start;
while(ptr!=NULL)
 {
  if(ptr->no%2==0)
   {
    printf("\nEVEN:%d",ptr->no);even++;
   }
  else
   {
    printf("\nODD :%d",ptr->no);odd++;
   }
 ptr=ptr->next;
 }
printf("\nEVEN  Number of Nodes:%d",even);
printf("\nODD   Number of Nodes:%d",odd);
printf("\nTotal Number Of Nodes:%d",cu);
return start;
}