-
Notifications
You must be signed in to change notification settings - Fork 0
/
single linklist ring.txt
117 lines (93 loc) · 1.21 KB
/
single linklist ring.txt
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
#include<iostream>
using namespace std;
struct node
{
int data;
node *next;
};
class ring
{
node *temp, *head, *n;
public:
ring()
{
temp = head = n = NULL;
}
void add()
{
temp = head;
if (head == NULL)
{
head = new node;
cin >> head->data;
temp = head;
head->next = head;
}
else
{
while (temp->next != head)
{
temp = temp->next;
}
if (temp->next == head)
{
n = new node;
cin >> n->data;
temp->next = n;
n->next = head;
temp = temp->next;
}
}
}
void disp()
{
temp = head;
while (temp->next != head)
{
cout << temp->data << " ";
temp = temp->next;
}
cout << temp->data;
cout << endl;
}
void del()
{
int key;
cout << "Enter the deletion key: ";
cin >> key;
temp = head;
n = temp->next;
while (temp->next != head)
{
if (head->data == key)
{
while (temp->next != head)
{
temp = temp->next;
}
head = head->next;
temp->next = head;
temp = head;
}
if (n->data == key)
{
temp->next = n->next;
break;
}
temp = temp->next;
n = n->next;
}
}
};
void main()
{
ring r;
r.add();
r.add();
r.add();
r.add();
r.add();
r.del();
r.del();
r.disp();
}