Create Singly Linked list by R4R Team

Singly Linked list:
Basically, In Singly linked list, every Node contains two columns
- data: To store data
- pointer : To store address of next Node

Now Create and Traverse a Linked List:

program-

#include< stdio.h>
#include< conio.h>
#include< alloc.h>
struct node{
struct node *link;
int data;
};
struct node *first=NULL;
void traverse()
{
struct node *ptr=first;
printf("Linklist is :\n");
while(ptr!=NULL){
printf("%d ",ptr->data);
ptr=ptr->link;
}
}
void main()
{
struct node *cpt,*ptr;
char ch;
clrscr();
first=(struct node*)malloc(sizeof(struct node));
printf("Enter first element in Linked list\n");
scanf("%d",&first->data);
ptr=first;
do
{
cpt=(struct node*)malloc(sizeof(struct node));
printf("Enter another data\n");
scanf("%d",&cpt->data);
ptr->link=cpt;
ptr=ptr->link;
printf("Continue(y/n) ?");
ch=getch();
}while(ch=='y');
ptr->link=NULL;
traverse();
getch();
}


output-

Enter first element in Linked list
2
Enter another data
4
Continue(y/n)?
Enter another data
1
Continue(y/n) ?
Enter another data
9
Continue(y/n) ?
Enter another data
0
Continue(y/n) ?
Linklist is :
2 4 1 9 0

In this program,
-Structure contain two coloumn data and link.
-'first' is the linked list pointer which points the starting Node of the Linked List.
- And at last Node, we Put Null that show the ending of the Linked List.
- We create a Linked List inside the main function.
- traverse() function is for access the data of the Linked list.




Leave a Comment:
Search
Categories
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!