AIM: To create 5 nodes for implementing singly linked list using c.
PROGRAM:
#include
#include
typedef struct Node
{
int data;
struct Node *next;
}node;
void insert(node *pointer, int data)
{
while(pointer->next!=NULL)
{
pointer = pointer -> next;
}
pointer->next = (node *)malloc(sizeof(node));
pointer = pointer->next;
pointer->data = data;
pointer->next = NULL;
6
}
void print(node *pointer)
{
if(pointer==NULL)
{
return;
}
printf(“%d “,pointer->data);
print(pointer->next);
}
int main()
{
int i;
node *start,*temp;
start = (node *)malloc(sizeof(node));
temp = start;
temp -> next = NULL;
printf(“1. Insert\n”);
printf(“2. Print\n”);
while(1)
{
int query;
scanf(“%d”,&query);
if(query==1)
7
{
printf(“\nEnter 5 nodes”);
for(i=1;i<=5;i++)
{
int data;
scanf(“%d”,&data);
insert(start,data);
}
}
PROGRAM:
#include
#include
typedef struct Node
{
int data;
struct Node *next;
}node;
void insert(node *pointer, int data)
{
while(pointer->next!=NULL)
{
pointer = pointer -> next;
}
pointer->next = (node *)malloc(sizeof(node));
pointer = pointer->next;
pointer->data = data;
pointer->next = NULL;
6
}
void print(node *pointer)
{
if(pointer==NULL)
{
return;
}
printf(“%d “,pointer->data);
print(pointer->next);
}
int main()
{
int i;
node *start,*temp;
start = (node *)malloc(sizeof(node));
temp = start;
temp -> next = NULL;
printf(“1. Insert\n”);
printf(“2. Print\n”);
while(1)
{
int query;
scanf(“%d”,&query);
if(query==1)
7
{
printf(“\nEnter 5 nodes”);
for(i=1;i<=5;i++)
{
int data;
scanf(“%d”,&data);
insert(start,data);
}
}