-
Notifications
You must be signed in to change notification settings - Fork 0
/
opp in linkedlist
152 lines (152 loc) · 2.48 KB
/
opp in linkedlist
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
#include<stdio.h>
#include<stdlib.h>
int count=0;
struct node
{
int data;
struct node *next;
} *head=NULL,*newnode=NULL,*current=NULL,*temp;
void insert_beginning()
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter Data for Node");
scanf("%d",&newnode->data);
newnode->next=head;
head=newnode;
count++;
}
void insert_end()
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter Data for Node: ");
scanf("%d",&newnode->data);
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
current=head;
while(current->next!=NULL)
current=current->next;
current->next=newnode;
}
count++;
}
void insert_position()
{
int pos,i;
printf("Enter the position to enter the new element\n");
scanf("%d",&pos);
if(pos<count)
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter Data for Node: ");
scanf("%d",&newnode->data);
for(i=1;i<pos;i++)
{
current=head;
current=current->next;
}
temp=current->next;
current->next=newnode;
newnode->next=temp;
count++;
}
else
printf("Enter a Valid Position");
}
void delete_beginning()
{
if(count>0)
{
current=head;
head=current->next;
free(current);
count--;
}
else
printf("Linked List is Empty\n");
}
void delete_end()
{
if(count>1)
{
current=head;
while(current->next->next!=NULL)
current=current->next;
current->next=NULL;
}
else
delete_beginning();
}
void delete_position()
{
int pos,i;
printf("Enter the position to delete the element\n");
scanf("%d",&pos);
if(pos<count)
{
for(i=1;i<pos;i++)
{
current=head;
current=current->next;
}
temp=current->next;
current->next=temp->next;
free(temp);
}
else
printf("Enter a Valid Position\n");
}
void display_LL()
{
if(count>0)
{
current=head;
printf("\nThe Elements of the Linked List Are:\n");
while(current!=NULL)
{
printf("%d\t",current->data);
current=current->next;
}
}
else
printf("Linked List is Empty\n");
}
void main()
{
int choice;
while(1)
{
printf("\nLinked List Operations-Menu:\n");
printf("1.Insertion at Beginning\n");
printf("2.Insertion at End\n");
printf("3.Insertion at Position\n");
printf("4.Deletion at Beginning\n");
printf("5.Deletion at End\n");
printf("6.Deletion at Position\n");
printf("7.Display the Linked List\n");
printf("8.Exit Program\n");
printf("\nEnter Your Choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1:insert_beginning();
break;
case 2:insert_end();
break;
case 3:insert_position();
break;
case 4:delete_beginning();
break;
case 5:delete_end();
break;
case 6:delete_position();
break;
case 7:display_LL();
break;
case 8:exit(0);
default:printf("Wrong Choice Entered\n");
}
}
}