package cse1030.datastructures;

import java.util.LinkedList;

/**
 * A simple stack implementation supporting push, pop, and
 * isEmpty operations.
 * 
 * @author CSE1030
 *
 * @param <E> the type of element held by this stack
 */
public class Stack<E> {
	private LinkedList<E> stack;

	/**
	 * Create an empty stack.
	 */
	public Stack() {
		this.stack = new LinkedList<E>();
	}

	/**
	 * Add an element to the top of the stack.
	 * 
	 * @param element the element to add to the top of the stack
	 */
	public void push(E element) {
		this.stack.addFirst(element);
	}

	/**
	 * Remove the top element of the stack. The element is returned
	 * to the client.
	 * 
	 * @return the element that was popped from the top of the stack
	 */
	public E pop() {
		return this.stack.removeFirst();
	}
	
	/**
	 * Returns <code>true</code> if this stack contains no elements.
	 * 
	 * @return <code>true</code> if this stack contains no elements
	 */
	public boolean isEmpty() {
		return this.stack.isEmpty();
	}
}