/30-career-development

Primary LanguageJavaScript

cf lab 30 - Binary Search Tree Data Structures

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

  • implement a BSTNode constructor
  • implement the following static methods
    • BSTNode.fromArray() should create BST from items in an array
  • implement the following prototype methods
    • node.appendChild(node) should append a child to the bst
    • node.min() should return the min value in a bst
    • node.max() should return the min value in a bst
    • node.find() should return the node that contains the value, null otherwise

Bonus Points:

  • 2pts
  • write a node.balance() that will balance the tree

Rubric:

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