Efficient balanced tree implementation in TypeScript

A weight balanced tree

Sized balanced tree implementation in javascript

An immutable weight balanced tree implementation.

Match balanced character pairs, like "{" and "}"

A persistent weight-balanced (bounded balance) tree.

Match balanced character pairs, like "{" and "}"

TypeScript definitions for balanced-match

Red-Black Tree implementation, as described in Introduction to Algorithms (CLR)

Tidy-tree layout engine for mermaid

balanced-tree

Rope-based persistent sequence type

htmlparser2 tree adapter for parse5.

mdast utility to serialize markdown

mdast utility to parse markdown

unist utility to visit nodes

unist utility to recursively walk over nodes, with ancestral information

balanced string matching, and replacing.

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

Regular Expressions parser in JavaScript