forked from crazy98/C---languge-challange
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlinked-list.c
91 lines (66 loc) · 1.5 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
88
89
90
91
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *next;
}*head;
void createList(int n);
int countNodes();
int main()
{
int n, total;
printf("Enter the total number of nodes: ");
scanf("%d", &n);
createList(n);
total = countNodes();
printf("\nTotal number of nodes = %d\n", total);
return 0;
}
void createList(int n)
{
struct node *newNode, *temp;
int data, i;
head = (struct node *)malloc(sizeof(struct node));
if(head == NULL)
{
printf("Unable to allocate memory.");
}
else
{
printf("Enter the data of node 1: ");
scanf("%d", &data);
head->data = data;
head->next = NULL;
temp = head;
for(i=2; i<=n; i++)
{
newNode = (struct node *)malloc(sizeof(struct node));
if(newNode == NULL)
{
printf("Unable to allocate memory.");
break;
}
else
{
printf("Enter the data of node %d: ", i);
scanf("%d", &data);
newNode->data = data;
newNode->next = NULL;
temp->next = newNode;
}
}
printf("SINGLY LINKED LIST CREATED SUCCESSFULLY\n");
}
}
int countNodes()
{
int count = 0;
struct node *temp;
temp = head;
while(temp != NULL)
{
count++;
temp = temp->next;
}
return count;
}