13 packages returned for Tags:"Avl"

A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.

Self balancing avl tree with Concat and Split operations.

.Net Standard 2.1 package contains implementation of Standard Binary Search Tree and AVL Tree.

TypeScript implementation of an AVL tree, a self-balancing binary search tree, with enumerable/iterable collections like set and map.

Immutable persistent collections, algebraic sum-type aka descriminated union, Ref type and supportive extensions for performant functional programming in C#. Split from the DryIoc: https://github.com/dadhi/DryIoc

TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains the interface definition assembly.

Immutable persistent collections, algebraic sum-type aka descriminated union, Ref type and supportive extensions for performant functional programming in C#. Split from the DryIoc: https://github.com/dadhi/DryIoc

TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains the primary implementations.

TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains implementations with Int64 rank indexing.

TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains HugeList, a class for efficiently managing very large lists.

TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains array-embedded implementations.

DataStructures for graphs, vertices,edges,nodes and trees. Contains a Binary Search Tree, AVL Tree and a PriorityQueue based on BST Tree which can handle duplicates

A library for all the data structures in C#. Every class is generic and reusable.