/lab-10-career-development

Primary LanguageJavaScript

cf lab 10 - Linked List 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 Linked List data structure by adding a remove(node) method
  • implement reverse() as a method on the Linked List prototype; from your whiteboard exercise
  • in comments above or within each function, note the Big-O runtime

Bonus Points:

  • implement findNthNode() as a method on the LL prototype
  • implement findMiddleNode() as a method on the LL prototype

Rubric:

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