Exploring the design space of binary search trees
An open-source research project that explores the design space of binary search trees to implement persistent and concurrent linear list data structures. This work includes multiple original contributions to data structures and algorithms, illustrations, console animations, and benchmarks.
Source: rtheunissen.github.io