Linked List Deletion At End

#include <stdio.h>

#include <stdlib.h>

struct node{

int data;

struct node *next;

};

struct node *head,*newnode,*prevnode;

int choice;

void main() {

printf("\n----Insertion At Beginning----");

struct node *temp;

do

{

newnode = (struct node *)malloc(sizeof(struct node));

printf("\nEnter data : ");

scanf("%d", &newnode->data);

newnode->next=head;

head=newnode;

printf("\nEnter your choice : (0/1) ");

scanf("%d", &choice);

}while(choice);

temp=head;

printf("\n");

while(temp!=0)

{

printf("--%d", temp->data);

temp=temp->next;

}

printf("\n\n----Deletion From End----");

temp=head;

while(temp->next!=0)

{

prevnode=temp;

temp=temp->next;

}

if(temp==head)

{

head=0;

}

else

{

prevnode->next=0;

}

free(temp);

temp=head;

printf("\n");

while(temp!=0)

{

printf("--%d", temp->data);

temp=temp->next;

}

}