An intrusive C 17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
-
Updated
Jun 5, 2023 - C
An intrusive C 17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
A set of useful C libraries in single header file
A small package of basic data structures and algorithms; currently focusing on BinaryTrees and structures that utilize BinaryTrees. This is very much in development, but please take a look at the README.md and tell me what you think
Provides a basic implementation of weight-balanced binary trees.
A set that keeps its elements in order
Ocaml Binary Search Tree Project
Add a description, image, and links to the weight-balanced-tree topic page so that developers can more easily learn about it.
To associate your repository with the weight-balanced-tree topic, visit your repo's landing page and select "manage topics."