{"_id":"@aureooms/js-bst","_rev":"2-3d383b7971dc3632e6527c8fd584ac73","name":"@aureooms/js-bst","description":"Binary search tree data structure library for JavaScript","dist-tags":{"latest":"3.0.0"},"versions":{"3.0.0":{"name":"@aureooms/js-bst","description":"Binary search tree data structure library for JavaScript","version":"3.0.0","author":{"name":"Aurélien Ooms","email":"aurelien.ooms@gmail.com"},"ava":{"require":["babel-polyfill","babel-register"]},"babel":{"presets":["latest"],"env":{"development":{"sourceMaps":"inline"}}},"bugs":{"url":"https://github.com/aureooms/js-bst/issues"},"dependencies":{},"devDependencies":{"@aureooms/js-compare":"^1.4.5","@aureooms/js-functools":"^2.0.3","@aureooms/js-itertools":"^3.1.1","@aureooms/js-random":"^1.0.2","ava":"^0.17.0","babel-cli":"^6.18.0","babel-polyfill":"^6.20.0","babel-preset-latest":"^6.16.0","codeclimate-test-reporter":"^0.4.0","coveralls":"^2.11.15","esdoc":"^0.5.2","nyc":"^10.1.2"},"homepage":"https://aureooms.github.io/js-bst","keywords":["adt","algorithm","avl","balanced","binary","black","bst","complexity","data","javascript","js","red","red-black","search","splay","structure","tree"],"license":"AGPL-3.0","main":"lib/index.js","repository":{"url":"git+https://github.com/aureooms/js-bst.git","type":"git"},"scripts":{"build":"babel src -d lib","cover":"nyc --reporter=lcov npm test","prepublish":"npm run build","test":"ava ./test/src --concurrency 8"},"gitHead":"6862b9a04af7f18060d8818b6e0deb238c20749f","_id":"@aureooms/js-bst@3.0.0","_shasum":"62de665bcc98587d4ea01a7434ae472eaf587918","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.5.0","_npmUser":{"name":"aureooms","email":"aurelien.ooms@gmail.com"},"dist":{"shasum":"62de665bcc98587d4ea01a7434ae472eaf587918","tarball":"https://registry.npmjs.org/@aureooms/js-bst/-/js-bst-3.0.0.tgz","integrity":"sha512-A/+Kmjj1h5l3Frq9pl5Bl6rmWDOECheL7YFoOwBERQo1u+9cagdDTnETP3Onijl38Ic5SigYcDYC0GKyUAplag==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCsHgdmQ1RaWdeHBXgWGNaz/A5cLiPn/2ECG1T3Qso+2wIhAKPLi1qnTLiqd/BfUAa8qOUdkln302vR4Qb0/tyOjRAC"}]},"maintainers":[{"name":"aureooms","email":"aurelien.ooms@gmail.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/js-bst-3.0.0.tgz_1487247164540_0.2114146095700562"}}},"readme":"[@aureooms/js-bst](https://aureooms.github.io/js-bst)\n==\n\n<img src=\"https://cdn.rawgit.com/aureooms/js-bst/master/media/sketch.png\" width=\"864\">\n\nBinary search tree data structure library for JavaScript.\nSee [docs](https://aureooms.github.io/js-bst).\nParent is [@aureooms/js-data-structures](https://github.com/aureooms/js-data-structures).\n\n```js\nlet tree = new SplayTree( compare.increasing ) ;\ntree.add( 58786 ) ;\ntree.find( 58787 ) ; // NIL\ntree.find( 58786 ) ; // BINGO\n```\n\n[![NPM license](http://img.shields.io/npm/l/@aureooms/js-bst.svg?style=flat)](https://raw.githubusercontent.com/aureooms/js-bst/master/LICENSE)\n[![NPM version](http://img.shields.io/npm/v/@aureooms/js-bst.svg?style=flat)](https://www.npmjs.org/package/@aureooms/js-bst)\n[![Build Status](http://img.shields.io/travis/aureooms/js-bst.svg?style=flat)](https://travis-ci.org/aureooms/js-bst)\n[![Coverage Status](http://img.shields.io/coveralls/aureooms/js-bst.svg?style=flat)](https://coveralls.io/r/aureooms/js-bst)\n[![Dependencies Status](http://img.shields.io/david/aureooms/js-bst.svg?style=flat)](https://david-dm.org/aureooms/js-bst#info=dependencies)\n[![devDependencies Status](http://img.shields.io/david/dev/aureooms/js-bst.svg?style=flat)](https://david-dm.org/aureooms/js-bst#info=devDependencies)\n[![Code Climate](http://img.shields.io/codeclimate/github/aureooms/js-bst.svg?style=flat)](https://codeclimate.com/github/aureooms/js-bst)\n[![NPM downloads per month](http://img.shields.io/npm/dm/@aureooms/js-bst.svg?style=flat)](https://www.npmjs.org/package/@aureooms/js-bst)\n[![GitHub issues](http://img.shields.io/github/issues/aureooms/js-bst.svg?style=flat)](https://github.com/aureooms/js-bst/issues)\n[![Documentation](https://aureooms.github.io/js-bst/badge.svg)](https://aureooms.github.io/js-bst/source.html)\n\n## Children\n\n  - [x] [@aureooms/js-red-black-tree](https://github.com/aureooms/js-red-black-tree)\n  - [x] Splay tree\n  - [ ] AVL tree\n  - [ ] 2-3 tree\n  - [ ] AA tree\n  - [ ] Scapegoat tree\n  - [ ] Treap\n\n## Reference\n\n  - https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree#Implementations\n  - http://opendatastructures.org/ods-java/7_Random_Binary_Search_Tree.html\n  - https://github.com/mikolalysenko/functional-red-black-tree\n","maintainers":[{"name":"aureooms","email":"aurelien.ooms@gmail.com"}],"time":{"modified":"2022-06-12T14:51:55.690Z","created":"2017-02-16T12:12:47.117Z","3.0.0":"2017-02-16T12:12:47.117Z"},"homepage":"https://aureooms.github.io/js-bst","keywords":["adt","algorithm","avl","balanced","binary","black","bst","complexity","data","javascript","js","red","red-black","search","splay","structure","tree"],"repository":{"url":"git+https://github.com/aureooms/js-bst.git","type":"git"},"author":{"name":"Aurélien Ooms","email":"aurelien.ooms@gmail.com"},"bugs":{"url":"https://github.com/aureooms/js-bst/issues"},"license":"AGPL-3.0","readmeFilename":"README.md"}