栈与队列的LinkedList实现-

利用LinkedList自定义实现队列和栈：

class Queue<T>
{
    private LinkedList<T> list = new LinkedList<T>();
    
    public void put(T data)
    {
        this.list.addLast(data);
    }
    
    public T get()
    {
        return this.list.removeFirst();
    }
    
    public boolean isEmpty()
    {
        return this.list.isEmpty();
    }
}

class Stack<T>
{
    private LinkedList<T> list = new LinkedList<T>();
    
    public void push(T data)
    {
        this.list.addLast(data);
    }
    
    public T pop()
    {
        return this.list.removeLast();
    }
    
    public T peek()
    {
        return this.list.getLast();
    }
    
    public boolean isEmpty()
    {
        return this.list.isEmpty();
    }
}