用LinkedList实现的队列数据结构

/**
队列：FIFO：first in first out.先进先出。
堆栈：LIFO：last in first out. 后进后出.
*/

/**队列容器
*/
class MyQueue<T>
{
	private LinkedList<T> link;
	MyQueue()
	{
		link = new LinkedList<T>();
	}
	public void in(T t)
	{
		link.addFirst(t);
	}
	public T out()
	{
		return link.removerLast();
	}
	public String toString()
	{
		return link.toString();
	}
	public boolean isNull()
	{
		return link.isEmpty();
	}
}