Scribd
Upload
8 views

Adobe Scan Oct 15, 2023

Uploaded by

White Devil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Adobe Scan Oct 15, 2023

Uploaded by

White Devil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

#include<stdlib.

h>
#include <stdio.h>

void create():
void display():
void insert_ begin():
void insert_end():
void insert_pos():
void delete_begin0:
void delete_end):
void delete_pos):

struct node

int info;
struct node "next:

struct node *start=NULL:


int main(0
{
int choice:

printf("\n MENU \n):


printf("\n 1.Create n):
printf("n 2.Display n');
printf("\n 3.Insert at the beginning n);
printf("\n 4.Insert at the end n);
printf("\n 5.Insert at specified position n);
printf("\n 6.Delete from beginning n):
printf("\n 7.Delete from the end n');
printf("\n 8.Delete from specified position n);
printf("\n 9.Exit n):

While(1)
{
printf("Enter your choice:t'):
scanf("%d",&choice):
switch(choice)
case 1:
create):
break;
case 2:
display):
break;
case 3:
insert_Lbegin():
break;
case 4:
insert_end):

break;
case 5:
insert_pos):
break;
case 6:
delete_begin):
break;
case 7:
delete_end():
break;
case 8:
delete_pos):
break;

case 9:
exit(0):
break;
default:
printf('n Wrong Choice:n):
break;
Ilend of switch
) l end of while loop
return 0;

void create()
struct node temp.'ptr;
temp=(struct node ")malloc(sizeof(struct node)):
if(temp=-NULL)
printf(nOut of Memory Space:n"):
exit(0):
printf("nEnter the data value for the node:t');
scanf("%d",&temp->info):
temp->next=NULL;
if(start==NULL)
start=temp:

else

ptr=start;
while(ptr->next!=NULL)

ptr=ptr->next;

ptr->next=temp;

void display()
struct node *ptr:
if(start==NULL)

printf(nList is empty:n'):
return;

else

ptr=start:
printf('nThe List elements are:n);
while(ptr!=NULL)
printf("%dtptr->info ):
ptr=ptr->next;

)
void insert _begin)
struct node *temp:
temp=(struct node *)malloc(sizeof(struct node):
if(temp==NULL)
printf(nOut of Memory Space:n"):
return;

printf('nEnter the data value for the node:t' );


scanf("%d",&temp->info);
Temp->next =NULL:
if(start==NULL)

start=temp;
else
ptr=start;
while(ptr->next !=NULL)
ptr=ptr-»next;

ptr->next =temp:

void insertpos()
{
struct node "ptr,"temp:
int i,pos:
temp-(struct node *)malloc(sizeof(struct node)):
if(temp==NULL)
print('nOut of Memory Spacen"):
return;

printf("'nEnter the position for the new node to be inserted:t"):


temp->next=start;
start=temp;

else
{
for(i=0,ptr=start,i<pos-1,ji++) (ptr=ptr->next;
if(ptr==NULL)
printf('nPosition not found:[Handle with care<n'):
return;
)
temp->next =ptr->next;
ptr->next=temp:

void delete_begin)
struct node ptr:
if(ptr==NULL)
printf('nList is Empty:n");
return;

else

ptr=start;
start=start->next:
printf('nThe deleted element is :%dt'.ptr->info):
free(ptr):

void delete_end()

struct node temp,*ptr;


if(start==NULL)
printf(nList is Empty:"):
exit(0):
)
else if(start->next ==NULL)
while(ptr->next!=NULL)
temp=ptr;
ptr=ptr->next;
temp->next=NULL;
printf(°nThe deleted element is:%dt".ptr->info):
free(ptr):
}
void delete_pos0
int i,pos:
struct node temp."ptr;
if(start==NULL)
printf(°'nThe List is Empty:n"):
exit(0):
else

printf("nEnter the position of the node to be deleted:t");


scanf("%d",&pos):
if(pos==0)
ptr=start;
start=start->next ;
printf('nThe deleted element is:%dt.ptr->info ):
free(ptr);
else

ptr=start;
for(i=0;i<pos,i++) ( temp=ptr; ptr=ptr->next;
if(ptr==NULL)
printf("nPosition not Found:n");
return;

temp->next =ptr->next
printf(nThe deleted element is:%dt".ptr->info ):
free(ptr);

You might also like