-
Notifications
You must be signed in to change notification settings - Fork 0
/
circularinsertion.c
75 lines (61 loc) · 1.28 KB
/
circularinsertion.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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
struct node *prev;
} *head, *n, *extra, *head1, *head2, *curr, *prev, *next, *ex;
int count=0;
void print(struct node *head){
n=head;
while(n->next!=head){
printf("%d\n",n->data);
n=n->next;
}
printf("%d\n",n->data);
}
void insert(struct node **head){
printf("Location of node :\n");
int x;
scanf("%d",&x);
n=*head;
extra=(struct node*)malloc(sizeof(struct node));
printf("Enter new node :\n");
scanf("%d",&extra->data);
while(n->data!=x){
n=n->next;
}
extra->next=n->next;
n->next=extra;
}
void create(struct node **head,int i,int size){
n=(struct node*)malloc(sizeof(struct node));
count++;
scanf("%d",&n->data);
if(*head==NULL){
*head=n;
prev=n;
}
n->next=NULL;
prev->next=n;
prev=n;
if(i==size-1)
n->next=*head;
}
int main(){
int x;
head=NULL;
printf("Enter size:\n");
scanf("%d",&x);
printf("Enter data:\n");
for(int i=0;i<x;i++){
create(&head,i,x);
}
printf("Original data:\n");
print(head);
insert(&head);
printf("New List :\n");
print(head);
printf("Count of nodes : %d\n",count);
}