* chore: Switch to Node 20 + Vitest
* chore: migrate to vitest mock functions
* chore: code style (switch to prettier)
* test: re-enable long-running test
Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!
see #1193
* chore: code style
* chore: fix failing tests
* Updated Documentation in README.md
* Update contribution guidelines to state usage of Prettier
* fix: set prettier printWidth back to 80
* chore: apply updated code style automatically
* fix: set prettier line endings to lf again
* chore: apply updated code style automatically
---------
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
* fix: fixed error in DepthFirstSearch algorithm and test: added tests for DepthFirstSearch algorithm.
* changed traverseDFS function parameters in DepthFirstSearch.js file
* Bugfix AVLTree comparator
The original insertBalance function was doing raw value comparisons as opposed to using the tree's comparator. This is clearly unintentional, and would (ultimately) cause the structure to segfault when constructed with the stringData included in the updated test.
I've added the fix, scanned the rest of the code for similar issues, and added the appropriate test case which passes successfully with the fix. The jest code coverage increases slightly as well with the changes.
* 100% jest code coverage
Added a couple of extra elements to the original test tree, and then removed elements in an order such that all previously uncovered branches of code are now covered.
Also added an emptyTree structure to test some additional (trivial) base cases.
* standard style fix
missed this from my previous commit
* Iterative & in-place BFS
An iterative analog to the traditional recursive breadth-first-search algorithm for binary trees.
This in-place solution uses the pre-existing "traversal" array for both tracking the algorithm as well as storing the result.
Also tweaked old code by resetting the traversal array each time the tree is traversed (otherwise you're only allowed to traverse a tree once which doesn't seem correct even with a single traversal function).
* Update BreadthFirstTreeTraversal.js
got rid of unnecessary currentSize
added currentNode for clarity
* refactor out traversal member var
.. per earlier discussion w mods
also tweaked the tests to achieve 100% coverage
* Bugfix AVLTree comparator
The original insertBalance function was doing raw value comparisons as opposed to using the tree's comparator. This is clearly unintentional, and would (ultimately) cause the structure to segfault when constructed with the stringData included in the updated test.
I've added the fix, scanned the rest of the code for similar issues, and added the appropriate test case which passes successfully with the fix. The jest code coverage increases slightly as well with the changes.
* 100% jest code coverage
Added a couple of extra elements to the original test tree, and then removed elements in an order such that all previously uncovered branches of code are now covered.
Also added an emptyTree structure to test some additional (trivial) base cases.
* standard style fix
missed this from my previous commit
* Iterative & in-place BFS
An iterative analog to the traditional recursive breadth-first-search algorithm for binary trees.
This in-place solution uses the pre-existing "traversal" array for both tracking the algorithm as well as storing the result.
Also tweaked old code by resetting the traversal array each time the tree is traversed (otherwise you're only allowed to traverse a tree once which doesn't seem correct even with a single traversal function).
* Update BreadthFirstTreeTraversal.js
got rid of unnecessary currentSize
added currentNode for clarity
* Implement BreadthFirstTreeTraversal in JavaScript
* Implement BreadthFirstTreeTraversal in JavaScript
* Implement BreadthFirstTreeTraversal in JavaScript
* Implement BreadthFirstTreeTraversal in JavaScript
