-
Notifications
You must be signed in to change notification settings - Fork 1
/
circularLL.cpp
88 lines (81 loc) · 1.6 KB
/
circularLL.cpp
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
#include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int value){
data=value;
next=NULL;
}
};
void insertAtTail(node* &head,int value){
node* n=new node(value);
if(head==NULL){
head=n;
return;
}
if(head->next==NULL){
head->next=n;
n->next=head;
return;
}
node* temp=head;
while(temp->next!=head)temp=temp->next;
temp->next=n;
n->next=head;
}
void insertAtHead(node* &head,int value){
node* n=new node(value);
if(head==NULL){
head=n;
return;
}
if(head->next==NULL){
n->next=head;
head->next=n;
head=n;
return;
}
node* temp=head;
while(temp->next!=head)temp=temp->next;
temp->next=n;
n->next=head;
head=n;
}
void deletion(node* &head,int pos){
node* temp=head;
if(pos==1){
while(temp->next!=head)temp=temp->next;
temp->next=head->next;
temp=head;
head=head->next;
delete temp;
return;
}
for(int i=1;i<pos-1;i++)temp=temp->next;
node* todelete=temp->next;
temp->next=temp->next->next;
delete todelete;
}
void display(node* head){
node* temp=head;
do{
cout<<temp->data<<" ";
temp=temp->next;
}while(temp!=head);
cout<<endl;
}
int main(){
node* head=NULL;
insertAtTail(head,1);
insertAtHead(head,0);
insertAtTail(head,2);
insertAtTail(head,3);
insertAtTail(head,4);
insertAtTail(head,5);
deletion(head,1);
deletion(head,5);
display(head);
return 0;
}