lab 15 - Stacks & Queues Data Structure

To Submit this Assignment

• fork this repository
• write all of your code in a directory named lab- + <your name> e.g. lab-duncan
• push to your repository
• submit a pull request to this repository
• submit a link to your PR in canvas
• write a question and observation on canvas

Description

• write at least three tests for each method that you've written
• complete the Stack data structure by adding a pop() and peek() method
• complete the Queue data structure by adding an dequeue() method
• implement Balanced Brackets using a Stack; from your whiteboard exercise
• in comments above or within each function, note the Big-O runtime

Bonus Points:

• implement Reverse Polish Notation using your Stack
• implement a Queue data structure using two Stacks

Rubric:

• Tests: 2pts
• Passes linter: 1pt
• Completed Data Structure: 5pts
• Big-O notation: 2pts