-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlink_list.cpp
More file actions
149 lines (140 loc) · 2.92 KB
/
link_list.cpp
File metadata and controls
149 lines (140 loc) · 2.92 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
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
#include <stdio.h>
#include <stdlib.h>
struct Node {
int INFO;
Node *LINK;
};
struct Node *P, *FIRST, *LAST;
int X;
void awal();
void in_kanan();
void in_kiri();
void in_tengah();
void del_kanan();
void del_kiri();
void del_tengah();
void tampil();
int main()
{
int pilihan;
while (1) {
printf("\nMENU");
printf("\n1. AWAL");
printf("\n2. INSERT KIRI");
printf("\n3. INSERT KANAN");
printf("\n4. INSERT TENGAH");
printf("\n5. TAMPIL");
printf("\n6. DELETE KIRI");
printf("\n7. DELETE KANAN");
printf("\n8. DELETE TENGAH");
printf("\n0. KELUAR");
printf("\nMasukkan pilihan: ");
scanf("%i", &pilihan);
switch (pilihan) {
case 1 : awal(); break ;
case 2 : in_kiri(); break ;
case 3 : in_kanan(); break ;
case 4 : in_tengah(); break ;
case 5 : tampil(); break ;
case 6 : del_kiri(); break ;
case 7 : del_kanan(); break ;
case 8 : del_tengah(); break ;
case 0 : exit(0);
}
}
return 0;
}
void awal() {
printf ("\nEntri Bilangan X : ");
scanf ("%i", &X);
P = (Node *) malloc(sizeof (Node));
P->INFO = X;
FIRST = P;
LAST = P;
P->LINK = NULL;
printf("\nSIMPUL AWAL SUDAH TERBENTUK");
}
void in_kanan()
{
printf ("\nEntri Bilangan X : ");
scanf ("%i", &X);
P = (Node *) malloc(sizeof (Node));
P->INFO = X;
LAST->LINK = P;
LAST = P;
LAST->LINK = NULL;
printf("\nINSERT KANAN, X = %i", X);
}
void in_kiri() {
printf ("\nEntri Bilangan X : ");
scanf ("%i", &X);
P = (Node *) malloc(sizeof (Node));
P->LINK = FIRST;
P->INFO = X;
FIRST = P;
printf("\nINSERT KIRI, X = %i", X);
}
void in_tengah() {
int simpul;
Node *Q;
printf("\nInsert setelah simpul ke: ");
scanf("%i", &simpul);
//ulang dan tempatkan pointer di depan simpul yg akan diinsertkan
Q = FIRST;
for (int i=1; i<simpul; i++) {
Q = Q->LINK;
}
printf ("\nEntri Bilangan X : ");
scanf ("%i", &X);
P = (Node *) malloc(sizeof (Node));
P->LINK = Q->LINK;
Q->LINK = P;
P->INFO = X;
printf("\nINSERT TENGAH, X = %i", X);
}
void del_kanan()
{
Node *Q;
//tempatkan pointer di node sebelum yang terakhir
Q = FIRST;
while (Q->LINK != LAST) {
Q = Q->LINK;
}
X = LAST->INFO;
free (LAST);
LAST = Q;
LAST->LINK = NULL;
printf("\nDELETE KANAN, X = %i", X);
}
void del_kiri() {
P = FIRST;
FIRST = P->LINK;
X = P->INFO;
free (P);
printf("\nDELETE KIRI, X = %i", X);
}
void del_tengah() {
int simpul;
Node *Q;
printf("\nDelete simpul ke: ");
scanf("%i", &simpul);
//ulang dan tempatkan pointer di depan simpul yg akan diinsertkan
Q = FIRST;
for (int i=1; i<simpul-1; i++) {
Q = Q->LINK;
}
X = P->INFO;
P = Q->LINK;
Q->LINK = P->LINK;
free(P);
printf("\nDELETE TENGAH, X = %i", X);
}
void tampil() {
Node *R;
printf("\nISI LINK LIST\n");
R = FIRST;
while (R != NULL) {
printf("%4i ->", R->INFO);
R = R->LINK;
}
}