Dana Jansens writes:
> There are 2 other BSTs that would work effectively to provide a
> persistent BST, while also maintaining a very efficient implementation
> for when persistence is not used. They are:
> - Treaps
> - Red-Black Trees
> Treaps can be expected to outperform Red-Black Trees f
Hello,
I am interested in contributing code for persistent binary search
trees to the GLib project. This would actually count as credit
towards a grad level data structures class for me, but I have a lot of
experience working with GLib in the past, and developing C-based open
source projects. Fi
