:eyeglasses: Fast AVL tree for Node and browser
TypeScript
119
32
MIT License
This project is a fast, non-recursive AVL tree implementation for Node.js and browsers, offering O(log n) operations for insertion, deletion, and search. It's designed for developers needing a performant, lightweight self-balancing binary search tree with a simple API and support for custom comparators.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of w8r/avl
TypeScript definitions for bintrees
Binary Search Trees
DTS Bundle Generator
A fully persistent balanced binary search tree
Google's common JavaScript library
Tooling which enables you to use TypeScript with ESLint
Native-ESM powered web dev build tool
Next generation testing framework powered by Vite
Support the repos that depend on w8r/avl
Top contributors
w8r
40 contributions
![dependabot[bot]'s profile](https://avatars.githubusercontent.com/dependabot[bot])
dependabot[bot]
12 contributions
DenisCarriere
2 contributions
SCG82
2 contributions
wcauchois
1 contributions
quadramadery
1 contributions
spirinvladimir
1 contributions
VincentJ711
1 contributions
ouuan
1 contributions
eugene-chernyshenko
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet