Data-Structures/linklist.c at master · rht6226/Data-Structures · 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
#include<stdio.h>
struct node
{
    int data;
    struct node *link;
}*head,*ptr;

void inf()
{
    int item;
    struct node *temp;
    temp=(struct node *)malloc(1*sizeof(struct node));
    printf("enter item:");
    scanf("%d",&item);

    if(temp==NULL)
    {
        printf("no memory");
        return;
    }

    else
    {
        temp->data=item;
        temp->link=NULL;
        if(head==NULL)
        {
            head=temp;
        }
        else
        {
            temp->link=head;
            head=temp;
        }
    }

}

void inb()
{
    int item;
    struct node *temp;
    temp=(struct node *)malloc(1*sizeof(struct node));
    printf("enter item:");
    scanf("%d",&item);

    if(temp==NULL)
    {
        printf("no memory");
        return;
    }

    else
    {
        temp->data=item;
        temp->link=NULL;
        if(head==NULL)
        {
            head=temp;
            return;
        }
        else
        {
            ptr=head;
            while(ptr->link!=NULL)
            {
                ptr=ptr->link;
            }
            ptr->link=temp;
        }

    }

}

void disp()
{
    ptr=head;
    while(ptr!=NULL)
    {
        printf("%d ",ptr->data);
        ptr=ptr->link;
    }
}

void ins()
{
    int key,item;
    struct node *temp;
    temp=(struct node *)malloc(1*sizeof(struct node));
    if(temp==NULL)
    {
        printf("No memory");
        return;
    }
    else if(head==NULL)
    {
        printf("list is empty");
    }
    else
    {
        ptr=head;
        printf("enter key:");
        scanf("%d",&key);
        printf("enter item");
        scanf("%d",&item);
        temp->data=item;
        temp->link=NULL;
        while(ptr->data!=key && ptr->link!=NULL)
        {
            ptr=ptr->link;
        }
        if(ptr->data==key)
        {
            temp->link=ptr->link;
            ptr->link=temp;
        }
        else
        {
            if(ptr->link==NULL)
            {
                printf("no key found");
            }
        }
    }
}

void main()
{
    int ch;

    head=NULL;
    do
    {
        printf("\n\n1.Insertion at front\n2.Display\n3.Insertion at end\n4.Insertion at a specific position\n");
        scanf("%d",&ch);
        switch(ch)
        {
            case 1:inf(&head);
            break;
            case 2:disp(&head);
            break;
            case 3:inb(&head);
            break;
            case 4:ins(&head);
            break;

        }
    }
    while(ch<=4);


    }