//栈
//public class Stack extends Vector 已经过时
Stack stack = new Stack();
//双端队列 可以作为栈来使用 push() 入栈 pop() 出栈 peek() 获取栈顶元素
Deque deque ; //ArrayDeque 底层是数组 LinkedList 底层是链表

//队列
Queue queue; //ArrayDeque 底层是数组 LinkedList 底层是链表

//表
List list ;

//模拟摞盘子
Deque deque1 = new LinkedList();
deque1.push(“盘子1”);
deque1.push(“盘子2”);
System.out.println(deque1.peek());
deque1.push(“盘子3”);
while(!deque1.isEmpty()){
String elem = deque1.pop();
System.out.println(elem);
}