an AVL tree implementation that supports node streams

Classic implementation of AVL tree with improvements like efficient search of nth item and iterator.

AVL Tree implementation written in TypeScript

High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)

A recursive implementation of the AVL tree data structure, for reference only.

A module to perform all the avl tree implementations using node.js.Minimizes height recursions hence faster

Adelson-Velsky-Landis (AVL) self-balancing binary trees in TypeScript

A comprehensive JavaScript package for implementing AVL Tree data structure, offering balanced tree operations for efficient data management.

A simple AVL tree implementation.

A simple AVL Tree and Max(Min) Heap library which works in both client side and server side with no dependency

avl tree based intrusive index

Merkle AVL tree with a LevelUp interface

A merklized immutable AVL tree optimized for fast read operations

Zero-dependency TypeScript sorted collections: SortedSet and SortedMap backed by AVL tree. Port of Python sortedcontainers, Java TreeSet/TreeMap, C# SortedSet/SortedDictionary.

Sorted List Implementation Using AVL Tree Data Structure

Different binary search tree implementations, including a self-balancing one (AVL)

Adelson-Velsky-Landis (AVL) self-balancing binary trees in TypeScript

Implementation of interval tree data structure.

Merkle AVL tree with a LevelUp interface

Different binary search tree implementations, including a self-balancing one (AVL)