A JavaScript implementation of Binary Indexed Tree with fast initialization

Binary Indexed Tree(aka Fenwick Tree) implementation

N-dimensional Binary Indexed Tree

Binary Indexed Tree (aka Fenwick Tree) implementation using a Redis backend

Binary Search Trees

Tree or binary tree printer, print any tree to terminal or debug window

Different binary search tree implementations, including a self-balancing one (AVL)

List of binary file extensions

Check if a file path is a binary file

High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)

Utilities and Classes for parsing, formatting and managing Ethereum ABIs.

Array#filter() with also detecting indexes of filtered values

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

Angular wrapper to IndexedDB database.

Interval search tree with TypeScript support

A fork of `binary-search-tree` 0.2.x with upgraded dependencies from the Sails core team.

Different binary search tree implementations, including a self-balancing one (AVL)

Check whether a binary version satisfies a semver range

The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.

IndexedDB-based stamper for @turnkey/http