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.
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 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.
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.
General purpose data structures and algorithms mostly to cover the functionallity or performance gap in the framework.
Includes: ProrityQueue, Bag, SymboleTable, Trie, UnionFind, Search Trees (BST, OST, RBT), sorting and graph algorithms.
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
