most-trees

A small javascript library that allows you to implement most tree data structures

Features/Documentation

• Binary Search Trees
• (Coming soon)Self Balancing Binary Search Trees
• Expression Trees
• Binary Node

Usage

Install most-trees using npm:

    > npm install most-trees

Next, require the package, and use the assets you need:

    const { ExpressionTree, BinaryTree } = require('most-trees');

    let expTree = new ExpressionTree('3x*(2x+2)-83');

    let bst = new BinaryTree([1, 2, 5, -51, 3, -14]);
    bst.insert(142);
    if (bst.search(3)) if (bst.remove(3)) console.log('removed 3 from tree');
    console.log(bst.toArray()); //logs [-51, -14, 1, 2, 5, 142]

Testing

To run testing for this library, install the dev-dependencies with:

    > npm install

Then, execute the tests:

    > npm test

License

MIT License

Copyright (c) 2020 Zebediah Perkins

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.