Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
-
Updated
Feb 10, 2022 - Rust
Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.
c++ associative containers based on the XOR scapegoat tree
Implementation of Scapegoat-Tree in c++.
Algorithms + Data Structures = Programs
c++ associative containers based on the scapegoat tree
A Go library which implements the Scapegoat Tree data structure.
This repository contains the code for the course Advance Data Structures
The project focuses on the implementation of a simpler, but still reasonably effective form of a self-balancing tree: the scapegoat tree. The project consists of a codebase for binary search trees along with the implementation of several additional methods for binary search trees.
Java binary search trees implementations: avl, red-black, AA tree, scapegoat tree, cartesian tree, splay tree. Bonus: skip list implementation.
TreeMap implementation using ScapeGoat Tree data structure in C++
Add a description, image, and links to the scapegoat-tree topic page so that developers can more easily learn about it.
To associate your repository with the scapegoat-tree topic, visit your repo's landing page and select "manage topics."