JAVA Lab: Implement a Stack

For this assignment, you will implement a Stack data structure. A stack can be implemented in several different ways. It is not inherently a node-based data structure, but you could implement it using nodes if you like.

The most important thing to remember with stacks is the way they push, pop, and peek data.

• push() : adds an element to the top/front of the stack
• pop() : removes the first element from the stack, and returns it.
• peek() : returns the first element from the stack without removing it.

Your stack should be able to support all of these functions. For example, you might have something like the following:

 public class Stack { private Node top; public void push(Node newNode) { // your implementation here } public Node pop() { // your implementation here } public Node peek() { // your implementation here } }