code/linked_list.c at main · WildTrio/code · GitHub

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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#include <stdio.h>
#include <stdlib.h>

struct node {
    int data;
    struct node* next;
};

struct node* head = NULL;

void creation() {
    struct node *newnode, *temp;
    int choice = 1;

    while (choice) {
        newnode = (struct node*)malloc(sizeof(struct node));

        if(newnode == NULL) {
            printf("Memory allocation failed.\n");
            return;
        }

        printf("Enter data: ");
        scanf("%d", &newnode->data);
        newnode->next = NULL;

        if (head == NULL) {
            head = newnode;
            temp = newnode;
        } else {
            temp->next = newnode;
            temp = newnode;
        }

        printf("Do you want to add another node? (1 for Yes, 0 for No): ");
        scanf("%d", &choice);
    }
}

void print() {
    struct node* temp = head;

    if (temp == NULL) {
        printf("List is empty.\n");
        return;
    }

    while (temp != NULL) {
        printf("%d -> ", temp->data);
        temp = temp->next;
    }
    printf("NULL\n");
}
void insert_begin(){
    struct node *newnode;
    newnode=(struct node*) malloc(sizeof(struct node));
    printf("Enter the data");
    scanf("%d",&newnode->data);
    newnode->next=head;
    head=newnode;
}
void insert_end(){
    struct node *newnode;
    newnode=(struct node*) malloc(sizeof(struct node));
    printf("Enter the data");
    scanf("%d",&newnode->data);
    newnode->next=0;
    struct node *temp=head;
    while(temp->next!=0){
        temp=temp->next;
    }
    temp->next=newnode;

}
void insert_pos(){
    struct node *newnode;
    struct node *temp=head;
    int pos,i=1;
    printf("enter the position");
    scanf("%d",&pos);
    while(i<pos-1){
        temp=temp->next;
        i++;
    }

    newnode=(struct node*) malloc(sizeof(struct node));
    printf("enter the data");
    scanf("%d",&newnode->data);
    newnode->next=temp->next;
    temp->next=newnode;
}
void del_beg(){
    struct node *temp;
    temp=head;
    head=temp->next;
    free(temp);
}
void del_end(){
    struct node *temp;
    struct node *prevnode;
    temp=head;
    while(temp->next!=0){
        prevnode=temp;
       temp=temp->next;
    }
    if(temp==head){
     free(temp);
     head=0;
    }
    else{
    prevnode->next=0;
    free(temp);
}
}
void del_pos(){
    struct node *temp;
    struct node *prevnode;
    int pos,i=1;
    scanf("%d",&pos);
    temp=head;
    while(i<pos){
        prevnode=temp;
        temp=temp->next;
        i++;
    }
    if(temp==head){
        head=0;
        free(temp);
    }
    else{
         prevnode->next=temp->next;
        free(temp);
    }


}
void length(){
    struct node *temp;
    temp=head;
    int count=0;
    while(temp->next!=0){
        temp=temp->next;
        count++;
    }
    printf("%d",count);
}
void reverse(){
    struct node *prevnode,*temp,*nextnode;
    prevnode=0;
    temp=head;
    nextnode=head;
    while(nextnode!=0){
        nextnode=temp->next;
        temp->next=prevnode;
        prevnode=temp;
        temp=nextnode;
    }
    head=prevnode;

}

int main() {
    creation();
    print();
    reverse();
    print();

    return 0;
}