Lecture Outline

• A stack is a last-in-first-out (LIFO) data structure
• A stack can use either an array or linked list to hold its data
• The push() method adds a new piece of data to the top of the stack
• The pop() removes the top element of the stack

Lecture Recording

• https://montana.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=6f9f38b3-58c8-4b52-80c8-b209015cf009

Lecture Slides

• Stacks (Array Implementation)

Code

• StackArray.java
• StackArrayDemo.java
• VideoGame.java
• oct14 project workspace

Click here to return to the course schedule