Layar Monitor :
VAR
FirstPointer, ToolPointer :ListPointer;
PROGRAM tambahsimpuldepan;
Memori :
......
VAR FirstPointer
17
9 (alamat)
(alamat)
Ø ToolPointer
17
9 (alamat)
(alamat)
FirstPointer, ToolPointer :ListPointer;
BEGIN
DataField
DataField
ToolPointer
= 100; NextField
= 100 =Ø
FirstPointer := NIL;
new(ToolPointer);
DataField
DataField=
ToolPointer
= 300; NextField
300 =9
WRITELN(“Masukkan Data Baru : ”);
READLN(ToolPointer^.DataField);
ToolPointer^.NextField := FirstPointer;
FirstPointer := ToolPointer;
new(ToolPointer);
WRITELN(“Masukkan Data Baru Lagi : ”);
READLN(ToolPointer^.DataField);
ToolPointer^.NextField := FirstPointer;
FirstPointer := ToolPointer; Layar Monitor :
END.
> Masukkan Data Baru : 100
> Masukkan Data Baru Lagi : 300
DATA STRUCTURES LECTURE NOTES
Bentuk-bentuk linked list
Singly-linked list
H Ø
49
F 20 G 49
1 I Ø
baru^.next := bantu^.next;
bantu^.next := baru;
Menambah (simpul) di belakang
F 20 G 1
Ø H Ø
baru^.next := NIL;
bantu^.next := baru;
Menghapus (simpul) di depan
F Ø
20 G 49 I Ø
bantu := awal^.next;
awal^.next := NIL;
awal := bantu;
bantu := NIL
Menghapus (simpul) di tengah
F 20 G 49
1 I Ø
baru^.next := bantu^.next;
bantu^.next := baru;
Menghapus (simpul) di belakang
H Ø
49
F 20 G 49
1 I Ø
baru^.next := bantu^.next;
bantu^.next := baru;
Membaca maju (linked list)
49 20
F 20 G 49 I 1 H Ø
bantu := awal;
while bantu <> NIL
begin
writeln (bantu^.data);
bantu := bantu^.next ;
end;
Struktur data yang dibangun dengan
Linked List