Scribd
Upload
36 views3 pages

Ds 3

This document contains code for a C program that implements functions to create, add to, delete from, and display a linked list. The functions include inserting nodes at the beginning and end of the list, deleting nodes from the beginning and end, and displaying the list.

Uploaded by

BCA SY 63 Aaditi Ranaware
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
36 views3 pages

Ds 3

This document contains code for a C program that implements functions to create, add to, delete from, and display a linked list. The functions include inserting nodes at the beginning and end of the list, deleting nodes from the beginning and end, and displaying the list.

Uploaded by

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

// Online C compiler to run C program online

/*Linked List*/
#include<stdio.h>
#include<stdlib.h>
int count=0;
struct Node *start=NULL;
struct Node
{
int data;
struct Node *next;
};
void insert_at_begin(int x)
{
struct Node *t;
t=(struct Node*)malloc(sizeof(struct Node));
count++;
if(start==NULL)
{
start=t;
start->data=x;
start->next=NULL;
return;
}
t->data=x;
t->next=start;
start=t;
}
void insert_at_end(int x)
{
struct Node *t,*temp;
t=(struct Node*)malloc(sizeof(struct Node));
count++;
if(start==NULL)
{
start=t;
start->data=x;
start->next=NULL;
return;
}
temp=start;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=t;
t->data=x;
t->next=NULL;
}
void delete_from_begin()
{
struct Node *t;
int n;
if(start==NULL)
{
printf("Linked List is empty!!!\n\n");
return;
}
n=start->data;
t=start->next;
free(start);
start=t;
count--;
printf("Deleted element is %d\n\n",n);
return;
}
void delete_from_end()
{
struct Node *t,*u;
int n;
if(start==NULL)
{
printf("Linked List is empty!!!\n\n");
return;
}
count--;
if(start->next==NULL)
{
n=start->data;
free(start);
start=NULL;
printf("Deleted element is %d\n\n",n);
return;
}
t=start;
while(t->next!=NULL)
{
u=t;
t=t->next;
}
n=t->data;
u->next=NULL;
free(t);
printf("Deleted element is %d\n\n",n);
return;
}
void display()
{
struct Node *t;
if(start==NULL)
{
printf("Linked List is empty!!!\n\n");
return;
}
printf("No of elements: %d\n",count);
printf("Elements are: ");
t=start;
while(t->next!=NULL)
{
printf("%d ",t->data);
t=t->next;
}
printf("%d ",t->data);
printf("\n\n");
}
int main()
{
int ch,data;
while(1)
{
printf("---LINKED LIST PROGRAMS---\n");
printf("1. INSERT AT BEGINING\n");
printf("2. INSERT AT END\n");
printf("3. DELETE FROM BEGINING\n");
printf("4. DELETE FROM END\n");
printf("5. DISPLAY LIST\n");
printf("6. EXIT\n\n");
printf("Enter your choice: ");
scanf("%d",&ch);
if(ch==1)
{
printf("Enter the insert value: ");
scanf("%d",&data);
printf("\n");
insert_at_begin(data);
}
else if(ch==2)
{
printf("Enter the insert value: ");
scanf("%d",&data);
printf("\n");
insert_at_end(data);
}
else if(ch==3)
{
delete_from_begin();
}
else if(ch==4)
{
delete_from_end();
}
else if(ch==5)
{
display();
}
else if(ch==6)
{
break;
}
else
{
printf("Wrong choice!!!\n");
}
}
return 0;
}

You might also like