View Code? Open in Web Editor
NEW
This project forked from codefellows-seattle-javascript-401d18/10-career-development
10-career-development's Introduction
dsa-lab-02-linked-lists
To Submit this Assignment
- fork this repository
- write all of your code in a directory named
lab-
+ <your name>
e.g. lab-susan
- 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
README.md
.gitignore
.eslintrc.json
.eslintignore
.package.json
- implement
reverse()
as a method on the Linked List prototype; from your whiteboard exercise
- complete the Linked List data structure by adding a
removeNthNode(n)
method
- in comments above or within each function, note the Big-O runtime
- Write a description on your code in your readme
- write at least three tests for each method that you've written
- LinkedList: 5pts
- Tests: 3pts
- Documentation & Big-O: 2pts
- implement
findNthNode()
as a method on the LL prototype
- implement
findMiddleNode()
as a method on the LL prototype
10-career-development's People
Contributors
Watchers