-
Notifications
You must be signed in to change notification settings - Fork 0
/
Circular_linked_list.c
148 lines (148 loc) · 3.61 KB
/
Circular_linked_list.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
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
#include<stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node* link;
}*newnode,*temp;
struct node *head=NULL;
// head=(struct node*)malloc(sizeof(struct node));
struct node *tail=NULL;
// tail=(struct node*)malloc(sizeof(struct node));
void create(){
char x;
do{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter the data:");
scanf("%d",&newnode->data);
newnode->link=NULL;
if(head==NULL){
head=newnode;
tail=newnode;
}
else{
tail->link=newnode;
tail=newnode;
tail->link=head;
}
fflush(stdin);
printf("Enter choice 'Y' or 'y' to continue:");
scanf("%c",&x);
}while(x=='y');
}
void display(struct node *head){
temp=head;
while(temp->link!=head){
printf("%d\n",temp->data);
temp=temp->link;
}
printf("%d",temp->data);
}
struct node *insert_beg(struct node *head,int val){
struct node *node_beg;
node_beg=(struct node*)malloc(sizeof(struct node));
node_beg->data=val;
//inserting a node at beginning
node_beg->link=head;
tail->link=node_beg;
head=node_beg;
return head;
}
void insert_end(struct node *tail,int data){
struct node *node_end;
node_end=(struct node*)malloc(sizeof(struct node));
node_end->data=data;
node_end->link=NULL;
tail->link=node_end;
node_end->link=head;
tail=node_end;
// while(head->link!=NULL){
// head=head->link;
// }
// head->link=node_end;
}
void insert_pos(){
int pos,val,i;
temp=head;
struct node *node_pos;
node_pos=(struct node*)malloc(sizeof(struct node));
printf("Enter the position and value:");
scanf("%d %d",&pos,&val);
for(i=0;i<pos-1;i++){
temp=temp->link;
}
node_pos->data=val;
node_pos->link=temp->link;
temp->link=node_pos;
}
void del_beg(){
temp=head;
head=head->link;
tail->link=head;
temp->link=NULL;
}
void del_end(){
temp=head;
while(temp->link!=tail){
temp=temp->link;
}
tail->link=NULL;
temp->link=head;
tail=temp;
}
void delete_pos(){
int pos,i;
printf("Enter the position to delete:");
scanf("%d",pos);
temp=head;
for(i=0;i<pos-1;i++){
temp=temp->link;
}
temp->link=temp->link->link;
}
void main(){
int choice;
do{
int data,val;
printf("\nEnter your choice:\n1.Creating and Printing the list\n2.Inserting\n3.Deletion\n4.Insertion at end\n5.Insertion at start\n6.Deletion at start\n7.Deletion at end\n8.Exit\n");
scanf("%d",&choice);
switch(choice){
case 1:
create();
display(head);
break;
case 2:
insert_pos();
display(head);
break;
case 3:
delete_pos();
printf("The elements after deleting:\n");
display(head);
break;
case 4:
printf("Enter the data to insert at end:");
scanf("%d",&data);
// insert_end=(head,data);
insert_end(tail,data);
display(head);
break;
case 5:
printf("Enter the data to insert at beginning:");
scanf("%d",&val);
head=insert_beg(head,val);
display(head);
break;
case 6:
del_beg();
display(head);
break;
case 7:
del_end();
display(head);
break;
case 8:
exit(0);
break;
}
}while(choice<9);
}