By :
Ilyas Priambodo 17.01.53.2002
Satria Nur Rasyid 17.01.53.2013
PENGERTIAN
■ Push
■ Pop
■ Clear
■ IsEmpty
■ Isfull
CONTOH
PROGRAM STACK
– MENGINPUTKAN MAX STACK
– MENGINPUTKAN ISI STACK
– MEMILIH MENGURANGI DATA (POP) / TIDAK
– PROSES POP BERULANG HINGGA DATA HABIS / USER
MENGHENTIKAN
MAIN
PROG
PUSH
MAIN
PROG
POP
MAIN
PROG
MAIN PROGRAM
System.out.print("Masukkan
Max_Stack : ");
max_st=in.nextInt();
for (int i = 0; i < max_st; i+
+) {
System.out.print("PUSH
-> "); a=in.next();
pushh(isi, a);
POP PUSH
MAIN PROGRAM
System.out.println("POP = y / anykeys=stop");
while(!a.equals("n")){
System.out.print("POP -> ");
a=in.next();
if (a.equals("y") && !isi.isEmpty()) {
popp(isi, a);
}else{
System.out.println("apa stack
kosong? "+isi.isEmpty());
System.out.println("stop");
break;
}
POP PUSH
QUEUE
■ EnQueue
■ DeqQueue
■ Clear
■ IsEmpty
■ IsFull
CONTOH