PROGRAM TO INSERT IN END OF LINEAR LINKED LIST
|
|
|
Download Attachment
|
/************************************************/
/*PROGRAM TO INSERT IN END 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;
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++;
}
printf("\nEnter the item tobe inserted: ");
scanf("%d",&item);
newnode=(struct linear_list*)malloc(sizeof(struct linear_list));
newnode->info=item;
if(start==NULL)
{
start=newnode;
newnode->next=NULL;
}
else
{
ptr=start;
while(ptr->next!=NULL)
{
ptr=ptr->next;
}
ptr->next=newnode;
newnode->next=NULL;
}
printf(“\n After insertion 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 3027 times
|
|
|
|