Stack & Queue (Day 3)

In this materials we will learn:
1. Stack Concept
2. Infix, Prefix, Postfix Notation
3. Queue Concept
4. Circular Concept
5. Priority Concept

Lets start:
1. Stack Concept.
So in this concept, the data stored in ordered manner. so lets say you have so many different plate, and you want to stored it in cabinets for plates, unfortunately the cabinets for plates is very small, so the solution is you stuck all the plate by insert one by one to the place.

so when you want to take the plate, than the last plate you put on, will be the first plate you take. or ussually its called LIFO (Last in First Out)

2. Infix, Prefix, Postfix Notation
This method have a same concept where each of it is inserting a data, the difference just where it written,
Prefix: Operator is written before operands
Infix: Operator is written between operands
Postfix:Operator is written after operands

3. Queue Concept
Queu Concept is a method that stores data in manners. or ussually the data were stored in FIFO(First In First Out)

4. Circular Concept
Circulare concept, based on the name, circular, the data that stored were like circle that if R reach maxn than set R to zero, do it to L.

5.Priority Concept
It is the concept that an abstract data type in each of it is assigned to priority.