STRUKTUR DATA
2
3
First
First Last
3
4
Last
First
First
4
5
STRUKTUR
info next
STRUKTUR
First
6
7
STRUKTUR
Last
First
7
8
8
9
ADT Primitif:
Primitif: – Insert First
– Create new list – Insert Last
– Create new element – Delete First
– Insert After – Delete Last
– Delete After
9
10
First
First Last
10
11
INSERT
Insert
Last
Insert
First
11
12
First 15 /
30 50
12
13
Kamus
p q : address
Algoritma
13
14
Kamus
p q : address
Algoritma
First
q 15 next(p) First(L)
{buat mekanisme agar q
menunjuk ke elemen terakhir}
30 50 next(q) p
14
15
Kamus
p q : address
Algoritma
First
q 15 next(p) First(L)
{buat mekanisme agar q
menunjuk ke elemen terakhir}
30 50 next(q) p
15
16
INSERT FIRST
Kamus
First
p q : address
Algoritma
q 15 next(p) First(L)
{buat mekanisme agar q
menunjuk ke elemen terakhir}
30 50 next(q) p
First(L) p
INSERT LAST
17
18
INSERT FIRST
18
19
First
First p p
/ 15 / 15
Kamus
Algoritma
First(L) p
next(p) First(L) circular
19
20
20
21
IMPLEMENTASI
21
22
TERIMA KASIH
22