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.

Binary Tree data structure for Javascript

Binary tree data structure

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

Binary Search Trees

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

A fully persistent balanced binary search tree

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

High-performance 2D spatial index for rectangles (based on R*-tree with bulk loading and bulk insertion algorithms)

Binary Tree data structure for Javascript

Turn any collection of objects into its own efficient tree or linked list using Symbol

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

Layout algorithms for visualizing hierarchical data.

List of binary file extensions

Check if a file path is a binary file

Implementation of binary trees as used in Ethereum.

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.

Merkle tree implemented as a persistent datastructure

A comprehensive package for implementing the Binary Tree data structure with essential methods for developers.