A fully persistent balanced binary search tree
javascript standard data structure library which benchmark against C++ STL
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
An implementation of the Fibonacci heap data structure
Read all the installed packages in a folder, and return a tree structure with all the data.
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.
An engine which produces an intermediary structure from HTML to create a React Native render tree.
Strongly typed trie data structure for path and URL-like strings.
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
Read all the installed packages in a folder, and return a tree structure with all the data.
A complete, fully tested data structure library written in TypeScript.
A fast, lightweight pattern matcher for tree structures such as an Abstract Syntax Tree (AST)
1D interval tree data structure
React TreeView displays hierarchical data in a traditional tree structure, supports user interaction. KendoReact TreeView package
A react component library for visualizing tree data structures
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.
Package implements data structures and algorithms for processing various types of graphs
Implementation of interval tree data structure.
React component for efficiently rendering large tree structures
Build filesystem tree structure from flat paths
A NestJS Module to do a deep dive through the dependency tree structure and print the dependencies.
GraphQL Parser providing simplier structure
Ceibo is a JavaScript micro library to model trees that evaluate arbitrary code when accessing its nodes.
Standard data structure
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
Convert HTML (or a `hast` syntax tree) to a valid DatoCMS Structured Text `dast` document
Syntax tree data structure for the lezer parser
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
react-virtualized-tree React component
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
A node module for creating a tree from text input
A super-light and customizable React hook to manage tree state like never before
javascript standard data structure library which benchmark against C++ STL