A fully persistent balanced binary search tree
javascript standard data structure library which benchmark against C++ STL
Curated collection of data structures for the JavaScript/TypeScript.
Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.
Syntax tree data structure and parser interfaces for the lezer parser
Read all the installed packages in a folder, and return a tree structure with all the data.
An implementation of the Fibonacci heap data structure
Object parser is a utility used by the the `Object Inspector` package, which creates a JSON tree structure with node types that help simplify the JavaScript type system. It also uses TypeScript to make logic around using the tree strongly typed.
A package of Essential JS 2 navigation components such as Tree-view, Tab, Toolbar, Context-menu, and Accordion which is used to navigate from one page to another
An engine which produces an intermediary structure from HTML to create a React Native render tree.
Construct Merkle Trees and verify proofs
A fast, lightweight pattern matcher for tree structures such as an Abstract Syntax Tree (AST)
Read all the installed packages in a folder, and return a tree structure with all the data.
A react component library for visualizing tree data structures
1D interval tree data structure
Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.
A complete, fully tested data structure library written in TypeScript.
React TreeView displays hierarchical data in a traditional tree structure, supports user interaction. KendoReact TreeView package
Implementation of interval tree data structure.
Package implements data structures and algorithms for processing various types of graphs
React component for efficiently rendering large tree structures
A NestJS Module to do a deep dive through the dependency tree structure and print the dependencies.
Build filesystem tree structure from flat paths
Ceibo is a JavaScript micro library to model trees that evaluate arbitrary code when accessing its nodes.
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
GraphQL Parser providing simplier structure
react-virtualized-tree React component
A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
ES6 Map Implemented in TypeScript
Syntax tree data structure for the lezer parser
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
Convert HTML (or a `hast` syntax tree) to a valid DatoCMS Structured Text `dast` document
A node module for creating a tree from text input
Utility to require multiple files in a folder tree with flexible options
Converts SPARQL JSON results to a tree-based structure
A super-light and customizable React hook to manage tree state like never before
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams