modul praktikum “struktur data” - Universitas Sriwijaya

DAFTAR ISI
DAFTAR ISI.........................................................................................................................................1
Bab 1. POINTER..................................................................................................................................2
Bab 2. ARRAY.....................................................................................................................................5
2.1. Array Satu Dimensi................................................................................................................5
2.2. Array Dua Dimensi................................................................................................................7
Bab 3. STRUCTURE.........................................................................................................................15
Bab 4. CLASS.....................................................................................................................................18
Bab 5. LINKED LIST........................................................................................................................39
5.1. Single Linked List.................................................................................................................39
5.2. Operasi Pada Single Linked List........................................................................................41
5.3. Double Linked List...............................................................................................................43
Bab 6. STACK....................................................................................................................................50
6.1. Definisi Stack..........................................................................................................................50
6.2. Stack dengan Array..............................................................................................................51
6.3. Double Stack dengan Array................................................................................................52
6.4. Stack dengan Single Linked List........................................................................................53
Bab 7. QUEUE...................................................................................................................................62
7.1. Definisi Queue.......................................................................................................................62
7.2. Implementasi Queue dengan Linear Array....................................................................62
7.3. Implementasi Queue dengan Circular Array.................................................................64
7.4. Implementasi Queue dengan Double Linked List.........................................................65
Bab 8. TREE........................................................................................................................................73
8.1. Definisi Tree...........................................................................................................................73
8.2. Jenis-jenis Tree.......................................................................................................................74
8.3. Operasi-operasi pada Binary Tree.....................................................................................75
8.4. Binary Search Tree................................................................................................................76
REFERENSI........................................................................................................................................84
1
mfachrz@gmail.com
Copyright@PIK-Unsri Maret 2006