An implementation of a Red-Black Tree for node.js
Want to see pretty graphs? Log in now!
npm install rbtree
|8||downloads in the last month|
|Last Published By|
|Version||0.3.0 last updated 6 months ago|
|Keywords||datastructure, tree, red-black, red-black tree|
"Wikipedia entry for Red-Black Trees"
tree = new RBTree(cmp)
cmp is a funtion is a function to compare your keys to determine ordering.
The function will take two of your key type (whatever that will be) and
cmp(a,b), it returns
a < b,
a == b and
a > b.
Number of entries in tree.
key:value pair. It will over-write a pre-existed entry for
value = tree.get(key)
undefined if the key was not found. However, you could
undefined as the value of a
key:value pair. Try not to do
that as it lessens the effectivity of this method.
removed = tree.delete(key)
Returns a boolean;
true if deleted,
- All nodes are either RED or BLACK
- The root node is BLACK
- All leaves (nulls) are considered BLACK
- Both children of RED nodes must be BLACK
- Every path from a node to the leaves (inclusive) have the same number of BLACK nodes.
Running Tests and Test-coverage
To run tests:
To run test coverage:
npm run-script test-cov open jscov.html