forked from Ankita-Nandkumar-Patil/HactoberFest2021-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked_list.c
87 lines (71 loc) · 1.29 KB
/
linked_list.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// Program to implement Linked list.
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *first;
void insert_node()
{
struct node *nn;
struct node *temp;
nn = (struct node *)malloc(sizeof(struct node));
printf("ENTER ELEMENT :");
scanf("%d",&nn->data);
nn->next = NULL;
if(first == NULL)
{
first = nn;
}
else
{
temp = first;
while(temp->next != NULL)
{
temp = temp->next;
}
temp->next = nn;
}
}
void display()
{
struct node *temp;
if(first == NULL)
{
printf("\nLINKED LIST IS YET NOT CREATED, NOTHING TO DISPLAY");
}
else
{
temp = first;
while(temp != NULL)
{
printf("%d\n",temp->data);
temp = temp->next;
}
}
}
int main()
{
int ch;
first = NULL;
do
{
printf("\n1 - INSERT\n");
printf("2 - DISPLAY\n");
printf("3 - EXIT\n");
printf("PROVIDE YOUR CHOICE : ");
scanf("%d",&ch);
switch(ch)
{
case 1: insert_node();
break;
case 2: display();
break;
case 3: exit(0);
}
}while(1);
return 0;
}