Exploring the design space of binary search trees : vimarsan

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.

Related Keywords

Tarjan Kim , Sen Tarjan , Rudi Theunissen , Intel , Google , Goodrich , Apache Commons Collections , Binary Search Trees , Vl , Red Black , Kavl , Pbst , Capegoat Tree ,

© 2025 Vimarsana