lab 25 - Tree 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

Your lab directory must include

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

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
- running any command line interface
- accessing each method
- running your tests

use the node fs module to read an HTML document into a buffer (minimal.html => found in the /assets dir)
parse the buffer and use the root <html> element, subsequent HTML tags, and their text content to build a tree data structure
- hint: you will need to refactor your node to allow a different type of data to be stored in the .value property. The remainder of the node should not change
  - ```
    Tree {
      root: Node {
        value: {
          eleName: 'xxx',
          textContent: 'yyy' (can be empty string??)
        },
        children: [{Node}, {Node}, ...]
      }
    }
```

2pts each
implement the ability to parse both classes & ids; and any other attribute nodes you would like to consider
- there is a test file in /assets dir called stretch.html
refactor your prettyPrint() method to display your tree as a valid HTML string
- this would be similar to what you would pass into a .innerHTML() method in JS