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

avl-tree-preservation-site-calculator-component React component

AVL tree: a self-balancing binary search tree

JavaScript implementation of AVL tree

AVL Tree implementation written in TypeScript

avl tree based intrusive index

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

A merklized immutable AVL tree optimized for fast read operations

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

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

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

Sorted List Implementation Using AVL Tree Data Structure

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

Merkle AVL tree with a LevelUp interface

🚀 Complete TypeScript Data Structures Library: Linked List, Hash Map, Concurrent HashMap, Stack, Queue, Set, Tree, BST, AVL Tree, Red-Black Tree, Graph, Heap, Trie with 100% test coverage, async-safe operations, and comprehensive algorithms. Perfect for

Merkle AVL tree with a LevelUp interface

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.

an AVL tree implementation that supports node streams