Datastructures-JS – The JavaScript data structures project

Datastructures-JS is an open-source project offering implementations of common data structures and sorting algorithms for JavaScript, with TypeScript support. Rather than packaging everything as one library, it maintains separate repositories for individual tools, including heaps and priority queues, queues, stacks, deques, linked lists, binary search trees and AVL trees, tries, graphs, and a round-robin structure. The collection is intended for developers who want reusable building blocks for applications or a practical way to explore how these structures work.

The repositories are published under the MIT license, allowing broad reuse, and cover both basic structures and more specialized options. For example, the priority queue is built on a heap, the tree package includes both ordinary binary search trees and self-balancing AVL trees, and the graph package supports directed as well as general graphs. A separate sorting project provides algorithms that accept custom comparators, so ordering can be adapted to different data types. The organization lists 14 repositories, with several actively maintained in 2025 and 2026; the priority-queue package is its most prominent repository by stars among those shown. The project’s repository overview and linked project board provide a starting point for finding the implementation relevant to a particular need.