class stack => last in first out , LIFO , push/pop, ArrayList | 2 | => pop | 1 | | 0 | |____________ | interface queue => first in first out, FIFO, offer/poll/peek, LinkedList(삭제시 자리이동 없음) add(Object o), remove(), element() 읽기 ; 예외발생 Queue q = new LinkedList(); LinkedList ll = new LinkedList(); import java.util.*; public class StackAndQueueEx { static final int MAX_SIZE = 5; static Queue q = new..