Introduction to the Linked List Data Structure and Implementation. Algorithm for creation of singly linked list in data structure. This program ready by Piyush Sharma under guidance Jitendra Kumar (Java Trainer at Vtech Academy of Computers)

1. Singly linked list
program in data
structure PPT

2. #include<stdio.h>
#include<conio.h>
struct node
{
int info;
node *next;
};
node *head,*tail;
void beg()
{
node *p=new node();
printf("n enter the number");
scanf("n%d",&p->info);
if(head==NULL)
{
p->next=NULL;
head=p;
tail=p;
}
else
{
p->next=head;
head=p;
}

3. }
void end()
{
node *p=new node();
printf("n enter the number");
scanf("n%d",&p->info);
if(head==NULL)
{
p->next=NULL;
head=p;
tail=p;
}
else
{
tail->next=p;
tail=p;
p->next=NULL;
}
}
void after()
{
int n;

4. printf("n enter the number you want to search");
scanf("n%d",&n);
node *max;
max=head;
while(max!=NULL)
{
if(max->info==n)
{
break;
}
max=max->next;
}
if(max==NULL)
{
printf("n number is not found");
}
else
{
node *p=new node();
printf("nentere the number");
scanf("%d",&p->info);
if(max==tail)
{

5. p->next=NULL;
tail->next=p;
tail=p;
}
else
{
p->next=max->next;
max->next=p;
}
}
}
void before()
{
int n;
printf("n enter the number you want to search");
scanf("n%d",&n);
node *max,*max1;
max=head;
max1=head;
while(max!=NULL)
{

6. if(max->info==n)
{
break;
}
max1=max;
max=max->next;
}
if(max==NULL)
{
printf("n number not found");
}
else
{
node *p=new node();
printf("n enter the number");
scanf("n%d",&p->info);
if(max==head)
{
p->next=head;
head=p;
}
else
{

7. p->next=max;
max1->next=p;
}
}
}
void dbeg()
{
if(head==NULL)
{
printf("n deletd number=%d",head->info);
}
else
{
printf("n deleted number is=>%d",head->info);
head=head->next;
}
}
void dend()
{
if(head==NULL)

8. {
printf("n underflow error");
}
else
{
node *max;
max=head;
while(max->next->next!=NULL)
{
max=max->next;
}
printf("n delete number %5d",tail->info);
max->next=NULL;
tail=max;
}
}
void dafter()
{
int n;
printf("n enter the number");
scanf("n%d",&n);
node *max;
max=head;

9. while(max!=NULL)
{
if(max->info==n)
{
break;
} max=max->next;
}
if(max==NULL)
{
printf("n number not found");
}
else
{
if(max->next->next==NULL)
{
printf("n deleted number%d",max->next-
>info);
max->next=NULL;
tail=max;
}
else
{
printf("n deleted number %d",max->next-
>info);
max->next=max->next->next;

10. }
}
void dbefore()
{
int n;
printf("n enter the number");
scanf("n%d",&n);
node *max,*max1,*max2;
max=head;
while(max!=NULL)
{
if(max->info==n)
{
break;
}
max2=max1;
max1=max;
max=max->next;
}
if(max==NULL)
{
printf("n number is not found");
}

11. else
{
if(max==head)
{
printf("n deleted number is %d",max->info);
max=max->next;
head=max;
}
else
{
printf("n deleted number %d",max1->info);
max2->next=max;
}
}
}
void display()
{
if(head==NULL)
{
printf("n underflow error");
}
else

12. {
node *max;
max=head;
while(max!=NULL)
{
printf("%5d",max->info);
max=max->next;
}
}
}
void main()
{
clrscr();
int ch;
head=NULL;
tail=NULL;
do
{
printf("n ....main menu.....");
printf("n 1.insert at the begginning");
printf("n 2.insert at the ending");
printf("n 3.insert at the position after");
printf("n 4.insert at the position before");
printf("n 5.delete at the beg");
printf("n 6.delete at the end");

13. printf("n 7,deleted at the position after");
printf("n 8.deleted at the position before");
printf("n 9.display");
printf("n 10.exit");
printf("n enter your choice");
scanf("n%d",&ch);
switch(ch)
{
case 1:beg();
break;
case 2:end();
break;
case 3:after();
break;
case 4:before();
break;
case 5:dbeg();
break;
case 6:dend();
break;
case 7:dafter();
break;
case 8:dbefore();

14. break;
case 9:display();
break;
default:printf("n you enter wrong
choice!!!!!!!!!");
break;
}
}while(ch!=NULL);
getch();
}
This program solved by Piyush Sharma (Presented by Jitendra Kumar JAVA Trainer at Vtech
Academy of Computers)- C | C++ | DS | JAVA | Android | Python & Oracle Expert