The document discusses representing a stack using a list. It begins with an overview of stack and queue ADTs as well as linear lists. It then covers representing a physical linear list, stack operations using a list representation including push and pop, and finally thanks the reader. Key points are that a stack can be implemented using a linear list by treating the list head as the stack top, and examples are given of push and pop operations that add and remove elements from the list representing the stack.

1. STACK DENGAN LIST
Defri Kurniawan
defri.kurniawan@dsn.dinus.ac.id

2. Struktur Data 2017
RENCANA KEGIATAN PERKULIAHAN SEMESTER
W Pokok Bahasan
1 ADT Stack
2 ADT Queue
3 List Linear
4 List Linear
5 List Linear
6 Representasi Fisik List Linear
7 Variasi List Linear
8 Ujian Tengah Semester
W Pokok Bahasan
9 Variasi List Linear
10 Double Linked List
11 Stack dengan Representasi List
12 Queue dengan Representasi List
13 List Rekursif
14 Pohon dan Pohon Biner
15 Multi List
16 Ujian Akhir Semester

3. Struktur Data 2017

4. Struktur Data 2017

5. Struktur Data 2017

6. Struktur Data 2017

7. Struktur Data 2017

8. Struktur Data 2017

9. Struktur Data 2017

10. Struktur Data 2017

11. Struktur Data 2017
Operasi-operasi StackList
void CreateStack(Stack *S) {
TOP(*S) = Nil;
}
boolean IsEmpty(Stack S) {
return (TOP(S)==Nil);
}
boolean IsFull(Stack S) {
return (NbElmt(S)==MaxEl);
}

12. Struktur Data 2017
Alokasi
address Alokasi(infotype X) {
address P;
P = (address)malloc(sizeof(ElmtStack));
if(P!=Nil) {
Info(P) = X;
Next(P) = Nil;
} else {
P = Nil;
}
return P;
}

13. Struktur Data 2017
Quiz
 Buatlah operasi push() dan pop()

14. Struktur Data 2017
Operasi Push
void Push(Stack *S, infotype X) {
address P;
P = Alokasi(X);
if(IsEmpty(*S)) {
TOP(*S) = P;
}else if(IsFull(*S)) {
print("Stack Fulln");
}else {
Next(P) = TOP(*S);
TOP(*S) = P;
}
}

15. Struktur Data 2017
Operasi Pop
void Pop(Stack *S, infotype *X) {
address P;
if(IsEmpty(*S)) {
printf("Stack kosongn");
} else {
P = TOP(*S);
*X = Info(P);
if(Next(P)==Nil) {
TOP(*S) = Nil;
} else {
TOP(*S) = Next(TOP(*S));
}
Next(P) = Nil;
Dealokasi(&P);
}
}

16. Struktur Data 2017
TERIMA KASIH