Make search go mega fast! O(log(n)) inserts and deletes on ordered lists, but with the twist that the original list before modification remains intact! Implemented by using path-copying as per “Making Data Structures Persistent” Driscoll, Sarnak, Sleator and Tarjan. PersistentRedBlackTreeSet This was quite tricky to implement, because you are not allowed parent pointers, so you … Continue reading A Java implementation of persistent red-black trees open sourced