-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsgCLLadd.cpp
More file actions
94 lines (93 loc) · 1.36 KB
/
sgCLLadd.cpp
File metadata and controls
94 lines (93 loc) · 1.36 KB
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
//singly circular LL add
#include<iostream>
using namespace std;
#define null 0
struct node
{
int data;
node* next;
};
node *first,*temp,*ttemp,*p,*q;
void addnode()
{
ttemp=new node;
cin>>ttemp->data;
ttemp->next=first;//default
if(first==null)
{
first=temp=ttemp;
ttemp->next=first;
}//circular ink
else
{
temp->next=ttemp;
ttemp->next=first;
temp=ttemp;
}
}
void add_before_first(int x)
{
temp=first;
while(temp->next!=first)
{
temp=temp->next;
}
ttemp=new node;
ttemp->data=x;
temp->next=ttemp;
ttemp->next=first;
first=ttemp;
}
void add_before_given(int x,int y)
{
temp=first;
ttemp=first;
while(temp->data!=x)
{
ttemp=temp;
temp=temp->next;
}
p=new node;
p->data=y;
if(temp==first)
{
q=first;
while(q->next!=first)
q=q->next;
p->next=temp;
q->next=p;
first=p;
}
else
{
p->next=temp;
ttemp->next=p;
}
}
void disp()
{
temp=first;
do{
cout<<temp->data<<"\n";
temp=temp->next;
}while(temp!=first);
}
int main()
{
first=ttemp=temp=null;
int n;
cout<<"enter no. of terms in LL: ";
cin>>n;
for(int i=0;i<n;i++)
{
addnode();
}
cout<<"\n";
disp();
cout<<"\n";
add_before_first(5);
disp();
cout<<"\n";
add_before_given(5,6);
disp();
}