Click here to hide categories Click here to show left categories

User: Home          welcome : Guest          Log In / Register here     




PROGRAM TO DELETE FROM LAST OF LINEAR LINKED LIST

Download Attachment
/***************************************************/
/*PROGRAM TO DELETE FROM LAST OF LINEAR LINKED LIST*/
/***************************************************/

#include < stdio.h>
#include < conio.h>
#include < malloc.h>
#include < process.h>
#include < ctype.h>

struct linear_list
{
    int info;
    struct linear_list *next;
}*start,*newnode,*ptr,*ptr1;

void main()
{
    int item;
int i;
    char ch;
    clrscr();
    newnode=(struct linear_list*)malloc(sizeof(struct linear_list));
    start=newnode;
    do
    {
        printf("\nEnter data: ");
        scanf("%d",&item);
        newnode->info=item;
        printf("\nDo you want to create another node:(y/n)");
        fflush(stdin);
        scanf("%c",&ch);
        if(tolower(ch)=='y')
        {
newnode->next=(struct linear_list*)malloc(sizeof(struct linear_list));
            newnode=newnode->next;
        }
        else
        {
            newnode->next=NULL;
        }
    }while(tolower(ch)!='n');
    printf(“\n Linked List is:\n”);
    ptr=start;
    i=1;
    while(ptr!=NULL)
    {
        printf("\nNode %d : %d",i,ptr->info);
        ptr=ptr->next;
        i++;
    }

    
    ptr=start->next;
    ptr1=start;
    while(ptr->next!=NULL)
    {
        ptr1=ptr;
        ptr=ptr->next;
    }
    ptr1->next=NULL;
    
printf("\nAfter deletion from the last the linked list is:\n");
ptr=start;
    i=1;
    while(ptr!=NULL)
    {
        printf("\nNode %d : %d",i,ptr->info);
        ptr=ptr->next;
        i++;
    }

    getch();
}
Share this article   |    Print    |    Article read by 2661 times
Author:
Rohit kakria
I am software developer
Related Articles:
Related Interview Questions: No related interview question