Data-structure Packages

A JavaScript package that implements the Adjacency List data structure for efficient graph representation and traversal.

A JavaScript package implementing the Adjacency Matrix data structure for efficient graph representation and operations.

A JavaScript package for implementing the B-Tree data structure, providing efficient data storage and retrieval.

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

An efficient JavaScript package implementing the Doubly Linked List data structure with essential methods and functionalities for managing doubly linked lists.

A package implementing Graph data structure

A package implementing Hash Map data structure with various methods for efficient data storage and retrieval.

A package implementing the Hash Set data structure with efficient operations for storing unique elements.

A package implementing the LinkedList data structure with essential methods and operations.

A JavaScript package that implements the Max-Heap data structure, providing essential methods for heap operations.

A JavaScript package implementing the Min-Heap data structure for efficient priority queue operations.

Priority Queue data structure implementation in JavaScript for efficient data handling and retrieval.

A robust JavaScript package for implementing the Queue data structure, offering essential methods for efficient data management.

A JavaScript package implementing the Red-Black Tree data structure for efficient data management.

A JavaScript package that provides an implementation of the Segment Tree data structure for efficient range queries and updates.

A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.

A JavaScript package that implements the Undirected Graph data structure with various important methods.

Provide commonly used data-structures for javascript.

Pair constructor: a tree-like data abstraction.

no description