1. Using Linked list operations, write LinkedStack class which implements the previous Stack interface using a...

  

Transcribed Image Text:

1. Using Linked list operations, write LinkedStack class which implements the previous Stack interface using a linked list. Note. Use the same Stackmain.java, just change the type of the stack object. 2. 3. Write reverseStack (Stack stack) method, which reverse the items of a given stack so the top is now at the bottom of the stack Write displayStack (Stack stack) method, which displays the items of a given stack without emptying the stack. public int size() { } return size; private void resize() { assert size == elements.length; Object[] a = new Object[2 * size]; System.arraycopy(elements, 0, a, 0, size); elements = (E[]) a; } } 1. Using Linked list operations, write LinkedStack class which implements the previous Stack interface using a linked list. Note. Use the same Stackmain.java, just change the type of the stack object. 2. 3. Write reverseStack (Stack stack) method, which reverse the items of a given stack so the top is now at the bottom of the stack Write displayStack (Stack stack) method, which displays the items of a given stack without emptying the stack. public int size() { } return size; private void resize() { assert size == elements.length; Object[] a = new Object[2 * size]; System.arraycopy(elements, 0, a, 0, size); elements = (E[]) a; } }