Skip to content

Updated Deletion_from_linked_list.c #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Dheeraj62 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Updated Deletion_from_linked_list.c #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 20 additions & 13 deletions Deletion_from_linked_list.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,14 +11,17 @@ struct node *removeValue(struct node *, int);

int main()
{
int n;
int n,i;
char ch;
printf("Enter the Size of linked list:");
scanf("%d", &n);
struct node *head = (struct node *)malloc(sizeof(struct node));
head->link = NULL;
struct node *temp;
for (int i = 0; i < n; i++)
{
for ( i = 0; i < n; i++)
{
int value;
printf("Enter the node value:\n");
scanf("%d", &value);
if (i == 0)
{
Expand All @@ -35,30 +38,35 @@ int main()
}
}
int k;
do
{

printf("\nEnter the value to be deleted:");
scanf("%d", &k);
head = removeValue(head, k);
temp = head;

printf("\nNew Linked list:");
while (temp != NULL)
{
{
printf("%d ", temp->info);
temp = temp->link;
}

printf("\nWant to delete more(y/n):");
scanf("%s",&ch);
}while(ch=='y'||ch=='Y');
return 0;
}
struct node *removeValue(struct node *head, int k)
{
struct node *temp = head;
if (head == NULL)
{
return NULL;
{ printf("\nUndeflow ...Linked list is empty");
}

if (k == 1)
if (k == temp->info)
{
head = head->link;
free(temp);

return head;
}
struct node *prev = head;
Expand All @@ -68,13 +76,12 @@ struct node *removeValue(struct node *head, int k)
if (temp->info == k)
{
prev->link = temp->link;
free(temp);

return head;
}
prev = temp;
temp = temp->link;
}

free(temp);
return head;
}