codefellows-seattle-javascript-401d21 / 35---binary-trees-and-binary-search-trees

lab 35 - Binary Trees and Binary Search Trees

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

Requirements

Configuration

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

Testing

• write at least three test assertions for each constructor method
• organize your tests into appropriate describe/it blocks for test output readability

Documentation

• in your README, write documentation for you data structures
• your documentation should includes code block usage examples
• provide instructions for:
  • installing and using your data structure
  • accessing each method
  • running your tests

Feature Tasks

• Add a remove(value) member function to the BinarySearchTree class presented in class.
• Add a preOrderTraversal and a postOrderTraversal member functions to the BinaryTree class presented in class.
• Add a isBalanced method to the BinarySearchTree class presented in class.

Rubric:

• Tests: 3pts
• Passes linter: 1pts
• Completed Data Structure: 3pts
• Big-O notation: 3pts