-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedListCreationAndTraversal.c
82 lines (64 loc) · 1.75 KB
/
LinkedListCreationAndTraversal.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
#include <stdio.h>
#include <stdlib.h>
struct Node
{
char data;
struct Node *next;
};
void LinkdeListTraversal(struct Node *ptr)
{
printf("Data in linked list is: \n");
while (ptr != NULL)
{
printf("%c", ptr->data);
ptr = ptr->next;
}
}
int main()
{
struct Node *head;
struct Node *second;
struct Node *third;
struct Node *fourth;
struct Node *fifth;
struct Node *sixth;
struct Node *seventh;
struct Node *eighth;
struct Node *nineth;
struct Node *tenth;
struct Node *eleventh;
head = (struct Node *)malloc(sizeof(struct Node));
second = (struct Node *)malloc(sizeof(struct Node));
third = (struct Node *)malloc(sizeof(struct Node));
fourth = (struct Node *)malloc(sizeof(struct Node));
fifth = (struct Node *)malloc(sizeof(struct Node));
sixth = (struct Node *)malloc(sizeof(struct Node));
seventh = (struct Node *)malloc(sizeof(struct Node));
eighth = (struct Node *)malloc(sizeof(struct Node));
nineth = (struct Node *)malloc(sizeof(struct Node));
tenth = (struct Node *)malloc(sizeof(struct Node));
eleventh = (struct Node *)malloc(sizeof(struct Node));
head->data = 'A';
head->next = second;
second->data = 'y';
second->next = third;
third->data = 'u';
third->next = fourth;
fourth->data = 's';
fourth->next = fifth;
fifth->data = 'h';
fifth->next = sixth;
sixth->data = ' ';
sixth->next = seventh;
seventh->data = 'K';
seventh->next = eighth;
eighth->data = 'u';
eighth->next = nineth;
nineth->data = 'm';
nineth->next = tenth;
tenth->data = 'a';
tenth->next = eleventh;
eleventh->data = 'r';
eleventh->next = NULL;
LinkdeListTraversal(head);
}