-
Notifications
You must be signed in to change notification settings - Fork 2
/
SINGLY_LINKED_LIST.cpp
200 lines (200 loc) · 2.72 KB
/
SINGLY_LINKED_LIST.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
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
//Single Linked List
#include<iostream.h>
#include<conio.h>
typedef struct node
{
int data;
struct node *link;
};
class LinkedList
{
node *Head;
public:
LinkedList()
{
Head=NULL;
}
~LinkedList()
{
delete Head;
}
void Append(int x);
void AddAfter(int loc, int x);
void AddAtBegin(int x);
void Display();
void Count();
void Delete(int x);
};
void LinkedList::Append(int num)
{
node *temp,*r;
temp=Head;
if(Head==NULL)
{
temp=new node;
temp->data=num;
temp->link=NULL;
Head=temp;
}
else
{
while(temp->link!=NULL)
temp=temp->link;
r=new node;
r->data=num;
r->link=NULL;
temp->link=r;
}
}
void LinkedList::AddAfter(int loc, int num)
{
node *temp,*r;
int i;
temp=Head;
if(temp==NULL)
{
cout<<"\n\n\t\t There are less than "<<loc<<" elements in list.";
return;
}
for(i=0;i<loc-1;i++)
{
if(temp==NULL)
{
cout<<"\n\n\t\t There are less than "<<loc<<" elements in list.";
return;
}
temp=temp->link;
}
r=new node;
r->data=num;
r->link=temp->link;
temp->link=r;
}
void LinkedList::AddAtBegin(int num)
{
node *temp;
temp = new node;
temp->data=num;
temp->link=Head;
Head=temp;
}
void LinkedList::Display()
{
cout<<"\n\n\n";
node *temp=Head;
while(temp!=NULL)
{
cout<<temp->data<<" --> ";
temp=temp->link;
}
cout<<"NULL";
getch();
}
void LinkedList::Count()
{
int c=0;
node *temp=Head;
while(temp!=NULL)
{
temp=temp->link;
c++;
}
cout<<"\n\n\n\t\tCount = "<<c;
}
void LinkedList::Delete(int num)
{
node *old,*temp;
temp=Head;
while(temp!=NULL)
{
if(temp->data==num)
{
if(temp==Head)
{
Head=temp->link;
delete temp;
return;
}
else
{
old->link=temp->link;
delete temp;
return;
}
}
else
{
old=temp;
temp=temp->link;
}
}
cout<<"\n\n\n\t\tThe data not found.";
}
int main()
{
LinkedList L;
int choice, x, loc;
do
{
clrscr();
cout<<"\n\t\t\tSingly Linked List";
cout<<"\n\t\t\t*****************";
cout<<"\n\t 1. CREATE A NODE";
cout<<"\n\t 2. ADD AT THE BEGINING";
cout<<"\n\t 3. ADD AT END";
cout<<"\n\t 4. ADD AFTER A SPECIFIC LOCATION";
cout<<"\n\t 5. DISPLAY ";
cout<<"\n\t 6. COUNT NO OF NODES";
cout<<"\n\t 7. DELETE A SPECIFIED NODE";
cout<<"\n\t 8. EXIT";
cout<<"\n\n\n Enter your choice : ";
cin>>choice;
switch(choice)
{
case 1:
cout<<"\n Enter a value : ";
cin>>x;
L.Append(x);
L.Display();
break;
case 2:
cout<<"\n Enter a value : ";
cin>>x;
L.AddAtBegin(x);
L.Display();
break;
case 3:
cout<<"\n Enter a value : ";
cin>>x;
L.Append(x);
L.Display();
break;
case 4:
cout<<"\n Enter the location : ";
cin>>loc;
cout<<"\n Enter a value : ";
cin>>x;
L.AddAfter(loc,x);
L.Display();
break;
case 5 :
L.Display();
break;
case 6:
L.Count();
L.Display();
break;
case 7:
cout<<"\n Enter a value to delete : ";
cin>>x;
L.Delete(x);
L.Display();
break;
case 8 :
cout<<"\n\n\n\t\t You are on Exit . . . ";
getch();
break;
}
}while(choice!=8);
return 0;
}