Sized-Balanced-Tree
Sized Balanced Tree implementation in JavaScript
| Operation | Average | Worst |
|---|---|---|
| Add | O(log n) | O(log n) |
| Remove | O(log n) | O(log n) |
| Find | O(log n) | O(log n) |
| Find minimum | O( log n) | O(log n) |
| Find maximum | O(log n) | O(log n) |
| Nth element | O(log n) | O(log n) |
Install package
npm install sized-balanced-tree Install devependecies and build library
-
Install dependencies
npm install -
Run and test in devloper environment
npm run run-dev -
Build non-minified version of the library
npm run build-dev -
Build library and use in production
npm run build-prodYou will find the library in
distfolder -
Update or generate api doc
npm run generate-doc -
Do benchmark
npm run benchmark -
Run tests
npm run test