- Read this document entirely and estimate how long this assignment will take.
- Work in a fork of this repository
- Work in a branch on your fork
- Protect your repository's
master
branch by activatingcontinuous-integration/travis-ci
status checks - Create a pull request from your
lab
+<your name>
branch to yourmaster
branch - Open a pull request to this repository
- Submit on canvas a question and observation,your original estimate, how long you spent, and a link to your pull request
Your lab directory must include
- README.md -- with a documentation about your lab
- .gitignore -- with a robust .gitignore
- .eslintrc -- with the class .eslintrc file
- .eslintignore -- with the class .eslintignore
- .package.json -- with all dependencies and dev-dependencies
- lib/ -- directory for holding your programs helper modules
- test/ -- directory for holding your programs unit and integration tests
- write at least three test assertions for each method of the Binary Tree Data Structure
- organize your tests into appropriate describe/test blocks for test output readability
- Implement an in-order traversal function that returns a string of the visited nodes.
- For example :
6,8,7,9,2,1,4,3,5
- For example :
- in your README, write documentation for you data structures
- your documentation should includes code block useage examples
- provide instructions for:
- installing and using your data structure
- accessing each method
- running your tests
- Tests: 2pts
- Passes linter: 1pts
- Completed Data Structure: 5pts
- Big-O notation: 2pt