Tuesday, March 22, 2016

Data structure : Stack and Queue

Stack
LIFO
Last in first out
operation :
push - nambah data di paling atas
pop - apus data di paling atas
top - ambil data di paling atas (bukan diapus)


Infix
Prefix
Postfix
5 + 4
+ 5 4
5 4 +
5 + 3 * 6
+ 5 * 3 6
5 3 6 * +

Depth first search - nyari ke bawahnya dulu baru ke samping

Queue
FIFO
First in first out
operation
push - nambah data di paling belakang
pop - apus data di paling depan
front - ambil data di paling depan (bukan diapus)

Breadth first search - nyari ke samping dulu baru ke bawah

No comments:

Post a Comment