DSA/Singlelinked list at master · AnkitRajHack/DSA · 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
170
171
172
173
174
175
176
#include<stdio.h>
#include<stdlib.h>

void insert();
void add();
void deletesp();
void display();
void deleteall();
void length();
struct node
{
    int data;
    struct node*link;
};
struct node*root=NULL;
int len,c;
int main()
{
    int n;
    while(1)
    {
    printf("Enter your choice:-\n");
    printf("1.Insert node.\n");
    printf("2.Delete a node.\n");
    printf("3.Add at specific location.\n");
    printf("4.Delete the linked list.\n");
    printf("5.Display.\n");
    printf("6.Length.\n");
    printf("7.Quit.\n");
    scanf("%d",&n);
    switch(n)
    {
        case 1:insert();
        break;
        case 2:deletesp();
        break;
        case 3:add();
        break;
        case 4:deleteall();
        break;
        case 5:display();
        break;
        case 6:length();
        len=c;
        printf("Length is:-%d\n",len);
        break;
        case 7:exit(0);
        default:
        printf("Wrong choice bro!!!!\n");

    }


}
}
void insert()
{
    struct node*temp;
    temp=(struct node*)malloc(sizeof(struct node));
    printf("Enter the data:-\n");
    scanf("%d",&temp->data);
    temp->link=NULL;
    if(root==NULL)
    {
        root=temp;
    }
    else{
        struct node*p;
        p=root;
    while(p->link!=NULL)
    {
        p=p->link;
    }
    p->link=temp;
    //temp is not require here we can use "tem" instead of temp
}
}
void display()
{
    struct node*p;
    p=root;
    if(root==NULL)
    {
        printf("Empty.\n");

    }

    {
        printf("%d ",p->data);
        p=p->link;
    }
    printf("\n");
}
}
void length()
{ struct node*p;
    p=root;c=0;
    while(p!=NULL)
    {++c;
        p=p->link;
    }


}
void deletesp()
{struct node *temp;
    int n;
    printf("Enter the location:-");
    scanf("%d",&n);
    if(n>len)
    {
        printf("Invalid location.\n");
    }

        else if(n==1)
{
    temp=root;
    root=temp->link;
    temp->link=NULL;
    free(temp);
}
else{
    int i=1;struct node*p=root;
    struct node*q;
    while(i<n-1)
    {
        p=p->link;
        i++;
    }
    q=p->link;
    p->link=q->link;
    q->link=NULL;
    free(q);
}
}
void add()
{
    int n;int i=1;
    struct node*temp;
    struct node*p;
    temp=(struct node*)malloc(sizeof(struct node));
     printf("Enter the location:-");
    scanf("%d",&n);
    scanf("%d",&temp->data);
    temp->link=NULL;
   if(n>len)
    {
     printf("Invalid location.\n");
    }
    else{
            p=root;
        while(i<n-1)
        {
            p=p->link;i++;
        }

    temp->link=NULL;
    temp->link=p->link;
    p->link=temp;

    }
}
    void deleteall()
    {

          struct node*p=root;
          {
              while(root!=NULL)
              {
                  p=root;
                  root=root->link;
                  free(p);
              }
          }

    }