Kivach
Cascading donations
Add repoPopularDonorsF.A.Q.
My repos

Footer

Subscribe to our newsletter

The latest news, articles, and resources, sent to your inbox.

DiscordTelegramTwitterMediumFacebookYouTubeGitHub

All information about repositories belongs to their owners.

More information about Kivach in the introductory article.

Built on Obyte

This project provides a self-balancing binary search tree implementation for Node.js using AVL trees, along with a basic BST option. It's designed for developers who need efficient data storage and retrieval, particularly those working with indexed data structures or building applications that require ordered data operations.

Total donated
Undistributed
Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of seald/node-binary-search-tree

Account's avatar
chaijs/chai
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
Account's avatar
mochajs/mocha
simple, flexible, fun test framework
Account's avatar
npm/node-semver
The semantic version parser used by npm.
Account's avatar
standard/standard
JavaScript Standard Style

Support the repos that depend on this repository

Top contributors

louischatriot's profile
louischatriot
77 contributions
hanwencheng's profile
hanwencheng
1 contributions
JamesMGreene's profile
JamesMGreene
1 contributions
rmanibus's profile
rmanibus
1 contributions
tex0l's profile
tex0l
1 contributions

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet
seald

seald/node-binary-search-tree

Self-balancing binary search tree for Node.js (uses AVL tree)

JavaScript
0
1
MIT License