-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCreateList.c
64 lines (52 loc) · 1.23 KB
/
CreateList.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
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node *next;
};
struct Node *createNode(int data) {
struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
if (newNode == NULL) {
printf("Memory allocation failed\n");
exit(1);
}
newNode->data = data;
newNode->next = NULL;
return newNode;
}
struct Node *createlist(struct Node *head, int n) {
struct Node *temp = NULL, *newNode = NULL;
for (int i = 0; i < n; i++) {
int data;
printf("Enter element: ");
scanf("%d", &data);
newNode = createNode(data);
if (head == NULL) {
head = newNode;
temp = head;
}
else {
temp->next = newNode;
temp = temp->next;
}
}
return head;
}
void traversallist(struct Node *head) {
printf("Linked List: ");
struct Node *temp = head;
while (temp!=NULL) {
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
}
int main() {
struct Node *head = NULL;
int n;
printf("Enter the number of elements in the list: ");
scanf("%d", &n);
head = createlist(head, n);
traversallist(head);
return 0;
}