12 packages returned for Tags:"BST"

Generic multi-dimensional binary search tree.

A Simple .NET Implementation of a KDTree for Nearest Neighbours searches with performances in mind.

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

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... More information

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

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... More information

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... More information

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... More information

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),... More information

A static 2D tree written in F#

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... More information

Advanced data structures for .NET