This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in the sense that a change to the structure destroys the old version, leaving only the new version available for use. In contrast, a persistent structure allows access to any version, old or new, at any time. We develop simple, systematic, and efficient techniques for making linked data structures persistent. We use our techniques to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion time and O (1) space bounds for insertion and deletion.
Driscoll et al. REF studied persistence in data structures considering binary search/red-black trees.
Making data structures persistent
STOC '86
Computer Science