-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.cpp
186 lines (183 loc) · 2.51 KB
/
linkedlist.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
#include <iostream>
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
using namespace std;
struct Data
{
int nilai;
Data *next;
};
Data *head;
Data *tail;
void awal ()
{
head=NULL;
}
bool isEmpty()
{
if (head==NULL)
return true;
return false;
}
void tambahDataDepan (int DataBaru)
{
Data *baru;
baru = new Data;
baru -> nilai = DataBaru;
baru -> next = NULL;
if (isEmpty())
{
head = baru;
head->next=NULL;
}
else
{
baru->next = head;
head = baru;
}
cout << "Data Depan" << DataBaru << "Masuk"<< endl;
}
void tambahDataBelakang (int DataBaru)
{
Data *baru, *bantu;
baru = new Data;
baru->nilai=DataBaru;
baru->next = NULL;
if (isEmpty())
{
head=baru;
head->next=NULL;
}
else
{
bantu=head;
while(bantu->next!=NULL)
{
bantu=bantu->next;
}
bantu->next=baru;
}
cout << "Data Belakang " << DataBaru << " Masuk" << endl;
}
void hapusDepan ()
{
Data *hapus;
int d;
if (!isEmpty())
{
if(head->next !=NULL)
{
hapus = head;
d = hapus->nilai;
head = hapus->next;
delete hapus;
}
else
{
d = head->nilai;
head = NULL;
}
cout << d << " Terhapus" << endl;
}
else cout << "Masih Kosong" << endl;
}
void hapusBelakang ()
{
Data *hapus, *bantu;
int tmp;
if (!isEmpty())
{
if (head->next!=NULL)
{
bantu = head;
while (bantu->next->next!=NULL)
{
bantu = bantu->next;
}
hapus = bantu->next;
tmp = hapus->nilai;
bantu->next=NULL;
delete hapus;
}
else
{
tmp=head->nilai;
head=NULL;
}
cout << tmp << " Terhapus" << endl;
}
else cout << "Masih Kosong" << endl;
}
void Cetak ()
{
if (!isEmpty())
{
Data *bantu;
bantu=head;
do
{
cout << bantu->nilai<< " ";
bantu=bantu->next;
}
while (bantu!=NULL);
cout << endl;
}
}
int panjang ()
{
int count=0;
if (!isEmpty())
{
count=1;
Data *bantu;
bantu=head;
if (bantu->next==NULL)
{
count=1;
}
else
{
do
{
count++;
bantu=bantu->next;
}
while (bantu->next!=NULL);
}
}
else
{
count=0;
}
return count;
}
int main()
{
awal();
tambahDataBelakang(5);
tambahDataDepan(7);
tambahDataBelakang(17);
tambahDataBelakang(1);
tambahDataBelakang(27);
tambahDataBelakang(10);
cout<<"-----------------"<<endl;
cout<<"\tnama :difa dlyaul haq "<<endl;
cout<<"\tkelas : bci 1"<<endl;
cout<<"\tnim: 22.61.0234"<<endl;
cout<<"-----------------"<<endl;
cout << "Data pada single linked list non circular:" << endl;
Cetak();
cout << "Data paling depan dihapus:" << endl;
hapusDepan();
cout << "Data pada single linked list non circular:" << endl;
Cetak();
cout << "Data paling belakang dihapus:" << endl;
hapusBelakang();
cout << "Data pada single linked list non circlar:" << endl;
Cetak();
cout << "Panjang linked list :" << endl;
cout << panjang();
getch();
return 0;
}