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!
Single-header C++11 implementation of the Cache Sensitive Search tree (CSS-tree)
Implementations of a variety of data structures and algorithms, mainly in C/C++.
The game of ‘Walls’ is comprised of an NxN board of squares (like chess, for example) and two players (say A and B), where N is odd and greater than 1. Each game is played twice, one time with player A starting the game and another with player B making the first move. The game has a start state, play rules that determine legal moves and an end s…
A C++ implementation of Hidden Binary Search Tree
Add a description, image, and links to the search-trees topic page so that developers can more easily learn about it.
To associate your repository with the search-trees topic, visit your repo's landing page and select "manage topics."