Construct a complete binary tree from given array

Binary Search Trees

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

Unpack multibyte binary values from buffers

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

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

A library to create and perform operations on merkle trees, shaped as a complete binary tree and implemented using the Poseidon hashing scheme

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.

A complete, fully tested data structure library written in TypeScript.

Read and write binary data on ArrayBuffers

Interval search tree with TypeScript support

Protocol Buffers for ECMAScript. The only JavaScript Protobuf library that is fully-compliant with Protobuf conformance tests.

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)

binary search tree & avl tree (self balancing tree) implementation in javascript

Check whether a binary version satisfies a semver range

Check if a binary is working

One-dimensional recursive spatial subdivision.