1.3 LIFO & FIFO

FIFO:
First In first Out
Queues are tubes
Queue have two pointer, a Head and Tail pointer



Example:
Print Queue














LIFO
Last In First Out
Stack - writes down the return address when a procedure is called
Only one pointer
Example: 
stack of paper