package DataStructure; public class LinkedListStack<E> implements Stack<E> { private LinkedList<E> list; public LinkedListStack(){ list = new LinkedList<>(); } @Override public int getSize() { return list.getSize(); } @Override public boolean isEmpty() { return list.isEmpty(); } @Override public void push(E e) { list.addFirst(e); } @Override public E pop(E e) { return list.removeFisr(); } @Override public E peek(E e) { return list.getFirst(); } @Override public String toString(){ StringBuilder res = new StringBuilder(); res.append("Stack:top"); res.append(list); return res.toString(); } }
=================================
package DataStructure; public interface Stack<E> { int getSize(); boolean isEmpty(); void push(E e); E pop(E e); E peek(E e); }