Buckets-JS

Buckets-JS copied to clipboard

we implemented AVL based on BSTree code

pourya-momtaz

i modified inorderTraverse by changing signature of function to inorderTraverse(callbacks, element = undefined) so that old functions would still work.

parhamsaremi

Removing the last element from a LinkedList is unnecessarily slow

2

Removing the first element from a LinkedList is fast, however, removing the last element is slow. The problem seems to be that in the removeElementAtIndex function rather than simply accessing...

tom-churchill

BSTree - inorderTraversal from specific starting point

2

Hi, this library is awesome thanks for the work you put into it. We’re using BSTree to index domain names from documents. We can use inorderTraversal to traverse documents by...

aguynamedben

e.g. [red-black tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) or [splay tree](https://en.wikipedia.org/wiki/Splay_tree), c.f. [npm bbtree](https://github.com/mourner/bbtree) If you insert into a non-balancing binary search tree from a sorted array, that can happen easily, the lookup performance breaks...

cmonacaps

Any chance you will add N-ary tree structure support?

SgtPooki

methods created when creating new object should be in prototype chain not in object itself

4

methods created when creating new object should be in prototype chain not in object itself. Since functions/method itself an object , it memory for it , when creating a object....

sk16